Two-way finite state transducers and monadic second-order logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 311-320

  Engelfriet, Joost ^a   Hoogeboom, Hendrik Jan ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

FINITE STATE; FINITE STATE TRANSDUCERS; MONADIC SECOND-ORDER LOGIC; TWO WAYS;

BACTERIOPHAGES;

EID: 84876913981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_28     Document Type: Conference Paper

References (19)

1. J.-C. Birget, Two-way automata and length-preserving homomorphisms, MST 29 (1996) 191-226.
2. J.R. Buchi, Weak second-order arithmetic and finite automata, Zeitschrift fur Mathematik, Logik und Grundlagen der Mathematik 6 (1960) 66-92.
3. M.P. Chytil, V. Jakl, Serial composition of 2-way finite-state transducers and simple programs on strings, in: 4th ICALP, LNCS vol. 52, Springer Verlag, 1977, pp. 135-147.
4. B. Courcelle, The monadic second-order logic of graphs V: on closing the gap between definability and recognizability, TCS 80 (1991) 153-202.
5. B. Courcelle, Monadic second-order definable graph transductions: A survey, TCS 126 (1994) 53-75.
6. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: Handbook of graph grammars and computing by graph transformation vol. 1 (G. Rozenberg, ed.), World Scientific Publishing Co., 1997, pp. 313-400.
7. J. Engelfriet, Three hierarchies of transducers, MST 15 (1982) 95-125.
8. J. Engelfriet, Context-free graph grammars, pp. 125-213.
9. J. Engelfriet, V. Oostrom, Logical description of context-free graph-languages, JCSS 55 (1997) 489-503.
10. S.A. Greibach, Visits, crosses, and reversals for nondeterministic oline machines, Inf. Control 36 (1978) 174-216.
11. S.A. Greibach, One way finite visit automata, TCS 6 (1978) 175-221.
12. S.A. Greibach, Hierarchy theorems for two-way finite state transducers, Acta Inf. 11 (1978) 89-101.
13. F.C. Hennie, One-tape, Turing machine computations, Inf. Control 8 (1965) 553-578.
14. J.E. Hopcroft, J.D. Ullman, An approach to a unified theory of automata, The Bell System Technical Journal 46 (1967) 1793-1829.
15. D. Kiel, Two-way a-transducers and AFL, JCSS 10 (1975) 88-109.
16. V. Rajlich, Bounded-crossing transducers, Inf. Control 27 (1975) 329-335.
17. G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, vol. 3: Beyond Words, Springer Verlag, 1997.
18. D. Seese, Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees, in: Tree Automata and Languages (M. Nivat, A. Podelski, eds.), Elsevier Science Publishers, 1992, pp. 83-114.
19. W. Thomas, Languages, automata, and logic, pp. 389-455.