Two-Way Finite State Transducers and Monadic Second-Order Logic

Authors:
Joost Engelfriet;Hendrik Jan Hoogeboom
Affiliations:
-;-
Venue:
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Year:
1999

Citing 9
Cited 2

The monadic second-order logic of graphs V: on closing the gap between definability and recognizability

MFCS '89 Selected papers of the symposium on Mathematical foundations of 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
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Context-free graph grammars

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
Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings

Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Two-way a-transducers and AFL

Journal of Computer and System Sciences

Partially-Ordered Two-Way Automata: A New Characterization of DA

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
String Tile Models for DNA Computing by Self-Assembly

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deterministic two-way finite state transductions are exactly the mso definable string transductions. Nondeterministic mso definable string transductions equal compositions of nondeterministic two-way finite state transductions that have the finite visit property. Both families of mso definable string transductions are characterized in terms of Hennie machines.