The equivalence of finite valued transducers (on HDT0L languages) is decidable
Theoretical Computer Science
On the valuedness of finite transducers
Acta Informatica
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
Journal of the ACM (JACM)
MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
On the Decidability of Bounded Valuedness for Transducers
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Decidability of the Equivalence for k-Valued Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Graph operations and monadic second-order logic: a survey
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Streaming transducers for algorithmic verification of single-pass list-processing programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking of linearizability of concurrent list implementations
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
On the containment and equivalence problems for two-way transducers
Theoretical Computer Science
Regular Transformations of Infinite Strings
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Two-way transducers with a two-way output tape
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We introduce nondeterministic streaming string transducers (NSSTS) - a new computational model that can implement MSO-definable relations between strings. An NSST makes a single left-to-right pass on the input string and uses a finite set of string variables to compute the output. In each step, it reads one input symbol, and updates its string variables in parallel with a copyless assignment. We show that NSST are closed under sequential composition and that their expressive power coincides with that of nondeterministic MSO-definable transductions. Further, we identify the class of functional NSSTS; such an NSST allows nondeterministic transitions, but for every successful run on a given input generates the same output string. We show that deciding functionality of an arbitrary NSST is decidable with PSPACE complexity, while the equivalence problem for functional NSSTS is PSPACE-COMPLETE. We also show that checking if the set of outputs of an NSST is contained within the set of outputs of a finite number of DSSTS is decidable in PSPACE.