MSO definable string transductions and two-way finite state transducers
Logic in Computer Science
2008-11-24 v1 Computational Complexity
Abstract
String transductions that are definable in monadic second-order (mso) logic (without the use of parameters) are exactly those realized by deterministic two-way finite state transducers. Nondeterministic mso definable string transductions (i.e., those definable with the use of parameters) correspond to compositions of two nondeterministic two-way finite state transducers that have the finite visit property. Both families of mso definable string transductions are characterized in terms of Hennie machines, i.e., two-way finite state transducers with the finite visit property that are allowed to rewrite their input tape.
Keywords
Cite
@article{arxiv.cs/9906007,
title = {MSO definable string transductions and two-way finite state transducers},
author = {Joost Engelfriet and Hendrik Jan Hoogeboom},
journal= {arXiv preprint arXiv:cs/9906007},
year = {2008}
}
Comments
63 pages, LaTeX2e. Extended abstract presented at 26-th ICALP, 1999