Thue specifications and their monadic second-order properties

Fundamenta Informaticae

Volumn 39, Issue 3, 1999, Pages 305-325

  Knapik, Teodor ^a   Calbrix, Hugues ^b  

^a UNIVERSITÉ DE LA RÉUNION   (France)

^b College Jean Lecanuet ^*  (France)

Author keywords

Automata; Infinite graphs; Monadic second order logic; String rewriting

Indexed keywords

EID: 0009717841     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-39305     Document Type: Article

References (27)

1. S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs. Journal of Algorithms, 12:308-340, 1991.
2. J.-M. Autebert, J. Berstel, and L. Boasson. Context-free languages and push-down automata. In G. Rozenberg and A. Salomaa, editors, Word, Language, Grammar, volume 1 of Handbook of Formal Languages, pages 111-174. Springer-Verlag, 1997.
3. R. V. Book and F. Otto. String-Rewriting Systems. Texts and Monographs in Computer Science. Springer-Verlag, 1993.
4. th International Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1530, pages 331-342, Chennai, Dec. 1998.
5. D. Caucal. On infinite transition graphs having a decidable monadic second-order theory. In F. M. auf der Heide and B. Monien, editors, 23th International Colloquium on Automata Languages and Programming, LNCS 1099, pages 194-205, 1996.
6. D. Caucal and T. Knapik. A string-rewriting characterization of recognizable graphs, 1999. Unpublished draft.
7. B. Courcelle. The monadic second-order logic of graphs, II: Infinite graphs of bounded width. Mathematical System Theory, 21:187-221, 1989.
8. B. Courcelle. Graph rewriting: An algebraic and logic approach. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 193-242. Elsevier, 1990.
9. B. Courcelle. Monadic second-order definable graph transductions: a survey. Theoretical Comput. Sci., 126:53-75, 1994.
10. B. Courcelle, J. Makowsky, and U. Rotics. Linear time solvable optimization problems on certain structured graph families, June 1998.
11. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 243-320. Elsevier, 1990.
12. C. C. Elgot and M. O. Rabin. Decidability and undecidability of extensions of the second-order theory of successor. Journal of Symbolic Logic, 31:169-181, 1966.
13. E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of programs. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 328-373, 1988.
14. D. Janin and I. Walukiewicz. Automata for the modal μ-calculus and related results. In J. Wiedermann and P. Hjek, editors, Mathematical Foundations of Computer Science, LNCS 969, pages 552-562, Rydzyna, 1995.
15. M. Jantzen. Basics of term rewriting. In G. Rozenberg and A. Salomaa, editors, Beyond Words, volume 3 of Handbook of Formal Languages, pages 269-337. Springer-Verlag, 1997.
16. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. Maibaum, editors, Background: Computational Structures, volume 2 of Handbook of Logic in Computer Science, pages 1-116. Oxford University Press, 1992.
17. T. Knapik and H. Calbrix. The graphs of finite monadic semi-Thue systems have a decidable monadic second-order theory. In C. S. Calude and M. J. Dinneen, editors, Combinatorics, Computation and Logic '99, pages 273-285, Auckland, Jan. 1999. Springer Verlag.
18. O. Kupferman and O. Grumberg. Branching-time temporal logic and tree automata. Information and Computation, (125):62-69, 1996.
19. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata and second-order logic. Theoretical Comput. Sci., 37:51-75, 1985.
20. F. Otto. On the property of preserving regularity for string-rewriting systems. In H. Comon, editor, Rewriting Techniques and Applications, LNCS 1232, pages 83-97, 1987.
21. D. Perrin. Finite automata. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 3-57. Elsevier, 1990.
22. A. Rabinovich. On translations of temporal logic of actions into monadic second-order logic. Theoretical Comput. Sci., 193:197-214, 1998.
23. J. Sakarovitch. Syntaxe des languages de Chomsky, essai sur le dterminisme. Thse d'Etat, Universit de Paris VII, 1979.
24. G. Snizergues. Formal languages and word rewriting. In Term Rewriting: French Spring School of Theoretical Computer Science, LNCS 909, pages 75-94, Font-Romeu, May 1993.
25. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 133-191. Elsevier, 1990.
26. A. Thue. Probleme her vernderungen von zeichenreihen nach gegebenen regeln. Skr. Vid. Kristiania, I Mat. Natuv. Klasse, 10:34 pp, 1914.
27. M. Wirsing. Algebraic specification. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 675-788. Elsevier, 1990.