10 citations · 13 across the 10 of their papers we have counts for
11 papers · 1 filter
Efficient Construction of Reversible Transducers from Regular Transducer Expressions
Luc Dartois, Paul Gastin, R. Govind +1
The class of regular transformations has several equivalent characterizations such as functional MSO transductions, deterministic two-way transducers, streaming string transducers,…
Scope-Bounded Reachability in Valence Systems
Aneesh K. Shetty, S. Krishna, Georg Zetzsche
Multi-pushdown systems are a standard model for concurrent recursive programs, but they have an undecidable reachability problem. Therefore, there have been several proposals to un…
One-way resynchronizability of word transducers
Sougata Bose, S. N. Krishna, Anca Muscholl +1
The origin semantics for transducers was proposed in 2014, and led to various characterizations and decidability results that are in contrast with the classical semantics. In this…
SD-Regular Transducer Expressions for Aperiodic Transformations
Luc Dartois, Paul Gastin, Shankara Narayanan Krishna
FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order definable functions. In t…
On the Separability Problem of String Constraints
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave +1
We address the separability problem for straight-line string constraints. The separability problem for languages of a class C by a class S asks: given two languages A and B in C, d…
Revisiting Underapproximate Reachability for Multipushdown Systems
S. Akshay, Paul Gastin, S Krishna +1
Boolean programs with multiple recursive threads can be captured as pushdown automata with multiple stacks. This model is Turing complete, and hence, one is often interested in ana…