MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
The string generating power of context-free hypergraph grammars
Journal of Computer and System Sciences
Iterated stack automata and complexity classes
Information and Computation
The monadic second-order logic of graphs VII: graphs as relational structures
Theoretical Computer Science - Special issue on logic and applications to computer science
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Regularity of splicing languages
Discrete Applied Mathematics
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
Logical description of context-free graph languages
Journal of Computer and System Sciences
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
Journal of the ACM (JACM)
Model checking
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Query automata over finite trees
Theoretical Computer Science
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Definable transductions and weighted logics for texts
Theoretical Computer Science
Millstream systems: a formal model for linking language modules by interfaces
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
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
Nondeterministic streaming string transducers
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
The equivalence problem for deterministic MSO tree transducers is decidable
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Languages recognizable by quantum finite automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Regular Transformations of Infinite Strings
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Two-way transducers with a two-way output tape
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Path- and index-sensitive string analysis based on monadic second-order logic
ACM Transactions on Software Engineering and Methodology (TOSEM) - Testing, debugging, and error handling, formal methods, lifecycle concerns, evolution and maintenance
From Monadic Second-Order Definable String Transformations to Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
From Two-Way to One-Way Finite State Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We extend a classic result of Büchi, Elgot, and Trakhtenbrot: MSO definable string transductions i.e., string-to-string functions that are definable by an interpretation using monadic second-order (MSO) logic, are exactly those realized by deterministic two-way finite-state transducers, i.e., finite-state automata with a two-way input tape and a one-way output tape. Consequently, the equivalence of two mso definable string transductions is decidable. In the nondeterministic case however, MSO definable string tranductions, i.e., binary relations on strings that are mso definable by an interpretation with parameters, are incomparable to those realized by nondeterministic two-way finite-state transducers. This is a motivation to look for another machine model, and we show that both classes of MSO definable string transductions are characterized in terms of Hennie machines, i.e., two-way finite-state transducers that are allowed to rewrite their input tape, but may visit each position of their input only a bounded number of times.