DMCA
MSO definable string transductions and two-way finite-state transducers (2001)
Cached
Download Links
- [arxiv.org]
- [arxiv.org]
- [www.wi.leidenuniv.nl]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Trans. Comput. Logic |
| Citations: | 30 - 3 self |
BibTeX
@ARTICLE{Engelfriet01msodefinable,
author = {Joost Engelfriet and Hendrik Jan Hoogeboom},
title = {MSO definable string transductions and two-way finite-state transducers},
journal = {ACM Trans. Comput. Logic},
year = {2001},
pages = {216--254}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
mso definable string transduction two-way finite-state transducer finite visit property nondeterministic two-way finite state transducer hennie machine deterministic two-way finite state transducer monadic second-order nondeterministic mso definable string transduction two-way finite state transducer input tape
