MSO Definable String Transductions and Two-Way Finite-State Transducers

ACM Transactions on Computational Logic

Volumn 2, Issue 2, 2001, Pages 216-254

  Engelfriet, Joost ^a   Hoogeboom, Hendrik Jan ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

B chi; Elgot; Hennie machine; interpretation; monadic secondorder logic; string transductions; Theory; Trakhtenbrot; two way finite state transducers

Indexed keywords

EID: 84886574830     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/371316.371512     Document Type: Article

References (66)

1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. 1969. A general theory of translation. Math. Syst. Theor. 3, 193-221.
2. Aho, A. V. and Ullman, J. D. 1970. A characterization of two-way deterministic classes of languages. J. Comput. Syst. Sci. 4, 523-538.
3. Birget, J.-C. 1996. Two-way automata and length-preserving homomorphisms. Math. Syst. Theor. 29, 191-226.
4. Bloem, R. and Engelfriet, J. 2000. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. Syst. Sci. 61, 1-50.
5. Büchi, J. R. 1960. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66-92.
6. Büchi, J. R. 1962. On a decision method in restricted second order arithmetic. In Proc. Int. Congr.
7. Logic, Methodology and Philosophy of Sciences 1960. Stanford University Press, Stanford, CA.
8. Chomsky, N. 1956. Three models for the description of language. IRE Transactions on Information Theory 2, 113-124.
9. Chytil, M. P. and Jakl, V. 1977. Serial composition of 2-way finite-state transducers and simple programs on strings. In Automata, Languages and Programming, Fourth Colloquium, A. Salomaa and M. Steinby, Eds. Lect. Notes Comput. Sci., vol. 52. Springer Verlag, Berlin, 135-147.
10. Clarke, E. M., Grumberg, O., and Peled, D. A. 1999. Model Checking. MIT Press, Cambridge, Ma, Usa.
11. Courcelle, B. 1991. The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comput. Sci. 80, 153-202.
12. Courcelle, B. 1992. The monadic second-order logic of graphs VII: Graphs as relational structures. Theor. Comput. Sci. 101, 1, 3-33.
13. Courcelle, B. 1994. Monadic second-order definable graph transductions: a survey. Theor. Comput. Sci. 126, 53-75.
14. Courcelle, B. 1997. 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: Foundations, G. Rozenberg, Ed. World Scientific Publishing Co., 313-400.
15. Courcelle, B. and Engelfriet, J. 1995. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Math. Syst. Theor. 28, 515-552.
16. Doner, J. 1970. Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 406-451.
17. Ebinger, W. 1995. Logical definability of trace languages. In The Book of Traces, V. Diekert and G. Rozenberg, Eds. World Scientific, 382-390. Appendix to Chapter 10.
18. Elgot, C. C. 1961. Decision problems of finite automata design and related arithmetics. Trans. AMS 98, 21-52.
19. Engelfriet, J. 1977. Top-down tree transducers with regular look-ahead. Math. Syst. Theor. 10, 289-303.
20. Engelfriet, J. 1982. Three hierarchies of transducers. Math. Syst. Theor. 15, 95-125.
21. Engelfriet, J. 1991a. A characterization of context-free NCE graph languages by monadic second-order logic on trees. In Graph Grammars and Their Application to Computer Science, H. Ehrig, H.-J. Kreowski, and G. Rozenberg, Eds. Lect. Notes Comput. Sci., vol. 532. Springer Verlag, Berlin, 311-327.
22. Engelfriet, J. 1991b. Iterated stack automata and complexity classes. Inf. Comput. 95, 21-75.
23. Engelfriet, J. 1997. Context-free graph grammars. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds. Vol. 3: Beyond Words. Springer Verlag, Berlin, 125-213.
24. Engelfriet, J. and Heyker, L. M. 1991. The string generating power of context-free hypergraph grammars. J. Comput. Syst. Sci. 43, 328-360.
25. Engelfriet, J. and Hoogeboom, H. J. 1999. Two-way finite state transducers and monadic second-order logic. In 26-th International Colloquium on Automata, Languages and Programming, J. Wiedermann, P. van Emde Boas, and M. Nielsen, Eds. Lect. Notes Comput. Sci., vol. 1644. Springer Verlag, Berlin, 311-320.
26. Engelfriet, J. and Maneth, S. 1999. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inf. Comput. 154, 34-91.
27. Engelfriet, J. and van Oostrom, V. 1997. Logical description of context-free graph languages. J. Comput. Syst. Sci. 55, 489-503.
28. Fischer, M. J. 1969. Two characterizations of the context-sensitive languages. In IEEE Conference Record of 10th Annual Symposium on Switching and Automata Theory. 149-156.
29. Greibach, S. A. 1978a. Hierarchy theorems for two-way finite state transducers. Acta Inf. 11, 89-101.
30. Greibach, S. A. 1978b. One way finite visit automata. Theor. Comput. Sci. 6, 175-221.
31. Greibach, S. A. 1978c. Visits, crosses, and reversals for nondeterministic off-line machines. Inf. and Con. 36, 174-216.
32. Griffiths, T. V. 1968. The unsolvability of the equivalence problem for A-free nondeterministic generalized machines. J. ACM 15, 409-413.
33. Gurari, E. M. 1982. The equivalence problem for deterministic two-way sequential transducers is decidable. SIAM J. Comput. 11, 3, 448-452.
34. Hennie, F. C. 1965. One-tape, off-line turing machine computations. Inf. and Con. 8, 553-578.
35. Hodges, W. 1993. Model Theory. Encyclopedia of Mathematics and its Applications, vol. 42. Cambridge University Press.
36. Hoogeboom, H. J. and Ten Pas, P. 1997. Monadic second-order definable text languages. ACM Trans. Comput. Syst. 30, 335-354.
37. Hopcroft, J. E. and Ullman, J. D. 1967. An approach to a unified theory of automata. The Bell System Technical Journal 46, 1793-1829.
38. Also in: IEEE Conference Record of 8th Annual Symposium on Switching and Automata Theory, Austin, Texas, 1967, pages 140-147.
39. Hopcroft, J. E. and Ullman, J. D. 1979. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, Mass.
40. Immerman, N. 1999. Descriptive Complexity. Springer Verlag, Berlin.
41. Kiel, D. 1975. Two-way a-transducers and AFL. J. Comput. Syst. Sci. 10, 88-109.
42. Kleene, S. C. 1956. Representation of events in nerve nets and finite automata. In Automata Studies. Annals of Mathematics Studies, vol. 34. Princeton University Press, Princeton, N.J., 3-42.
43. Kurshan, R. P. 1994. Computer-Aided Verification of Coordinated Processes. Princeton University Press, Princeton, N.J.
44. Lapoire, D. 1998. Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width. in 15th Annual Symposium on Theoretical Aspects of Computer Science. Lect. Notes Comput. Sci., vol. 1373. Springer Verlag, Berlin, 618-628.
45. Lautemann, C., McKenzie, P., Schwentick, T., and Vollmer, H. 1999. The descriptive complexity approach to LOGCFL. In 16th Symposium on Theoretical Aspects of Computer Science, C. Meinel and S. Tison, Eds. Lect. Notes Comput. Sci., vol. 1563. Springer Verlag, Berlin, 444-454. Full version: Electronic Colloquium on Computational Complexity, Report TR98-059.
46. McCulloch, W. S. and Pitts, W. 1943. A logical calculus of the ideas imminent in nervous activity. Bull. Math. Bioph. 5, 115-133.
47. McNaughton, R. and Papert, S. 1971. Counter-free automata. MIT Press, Cambridge, MA.
48. Myhill, J. 1957. Finite automata and the representation of events. Tech. Rep. WADD TR-57-624, Wright Patterson AFB, Ohio.
49. Nerode, A. 1958. Linear automata transformation. Proc. AMS 9, 541-544.
50. Nijholt, A. 1982. The equivalence problem for LL- and LR-regular grammars. J. Comput. Syst. Sci. 24, 149-161.
51. Pixton, D. 1996. Regularity of splicing languages. Discr. Appl. Math. 69, 101-124.
52. Rabin, M. O. 1963. Real-time computation. Isr. J. Math 1, 203-211.
53. Rabin, M. O. 1969. Decidability of second-order theories and automata on infinite trees. Trans. AMS 141, 1-35.
54. Rabin, M. O. 1977. Decidable theories. In Handbook of Mathematical Logic, J. Barwise, Ed. Studies in Logic and the Foundations of Mathematics, vol. 30. North-Holland, 595-629.
55. Rabin, M. O. and Scott, D. 1959. Finite automata and their decision problems. IBM J. Res. Dev. 3, 114-125.
56. Also in: E. F. Moore, Ed., Sequential Machines: Selected Papers. Addison-Wesley, Reading, MA, 1964, pages 63-91.
57. Rajlich, V. 1975. Bounded-crossing transducers. Inf. and Con. 27, 329-335.
58. Seese, D. 1992. Interpretability and tree automata: a simple way to solve algorithmic problems on graphs closely related to trees. In Tree Automata and Languages, M. Nivat and A. Podelski, Eds. Elsevier Science Publishers, Amsterdam, 83-114.
59. Shepherdson, J. C. 1959. The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3, 198-200.
60. Also in: E. F. Moore, Ed., Sequential Machines: Selected Papers. Addison-Wesley, Reading, MA, 1964, pages 92-97.
61. Thatcher, J. W. and Wright, J. B. 1968. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theor. 2, 57-82.
62. Thomas, W. 1997a. Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In Structures in Logic and Computer Science-A Selection of Essays in Honor of A. Ehrenfeucht, J. Mycielski, G. Rozenberg, and A. Salomaa, Eds. Lect. Notes Comput. Sci., vol. 1261. Springer Verlag, Berlin, 118-143.
63. Thomas, W. 1997b. Languages, automata, and logic. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds. Vol. 3: Beyond Words. Springer Verlag, Berlin, 389-455.
64. Trakhtenbrot, B. A. 1962. Finite automata and the logic of one-place predicates. Siberian Mathematical Journal 3, 103-131 (in Russian).
65. English translation: American Mathematical Society Translations, Series 2, 59 (1966), 23-55.
66. Yu, S. 1997. Regular languages. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds. Vol. 1: Word, Language, Grammar. Springer Verlag, Berlin, 41-110.