Finitary Compositions of Two-way Finite-State Transductions

Authors:
Joost Engelfriet;Hendrik Jan Hoogeboom
Affiliations:
LIACS, Leiden University, PO Box 9512, 2300 RA Leiden, The Netherlands. E-mail: {engelfri,hoogeboo}@liacs.nl;LIACS, Leiden University, PO Box 9512, 2300 RA Leiden, The Netherlands. E-mail: {engelfri,hoogeboo}@liacs.nl
Venue:
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Year:
2007

Citing 9
Cited 0

Iterated stack automata and complexity classes

Information and Computation
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
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
A comparison of tree transductions defined by monadic second order logic and by attribute grammars

Journal of Computer and System Sciences
MSO definable string transductions and two-way finite-state transducers

ACM Transactions on Computational Logic (TOCL)
The Book of Traces

The Book of Traces
Trace Theory

Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

The hierarchy of arbitrary compositions of two-way nondeterministic finite-state transductions collapses when restricted to finitary transductions, i.e., transductions that produce a finite set of outputs for each input. The hierarchy collapses to the class of nondeterministic MSO definable transductions, which is inside the second level of that hierarchy. It is decidable whether a composition of two-way nondeterministic finite-state transducers realizes a finitary transduction (i.e., is MSO definable).