MSO definable string transductions and two-way finite state transducers
| dc.creator | Engelfriet, Joost | |
| dc.creator | Hoogeboom, Hendrik Jan | |
| dc.date | 1999-06-04 | |
| dc.date.accessioned | 2026-07-07T10:20:13Z | |
| dc.date.available | 2026-07-07T10:20:13Z | |
| dc.description | 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. | |
| dc.description | 63 pages, LaTeX2e. Extended abstract presented at 26-th ICALP, 1999 | |
| dc.identifier | https://arxiv.org/abs/cs/9906007 | |
| dc.identifier | http://arxiv.org/abs/cs/9906007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174776 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Computational Complexity | |
| dc.subject | F.4.1; F.4.3; F.1.1 | |
| dc.title | MSO definable string transductions and two-way finite state transducers | |
| dc.type | text |