On infinite transition graphs having a decidable monadic theory

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 79-115

  Caucal, Didier ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SIMULATION; SET THEORY; THEOREM PROVING;

DECIDABLE MONADIC THEORY;

GRAPH THEORY;

EID: 0037209825     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00089-5     Document Type: Article

References (19)

1. L. Boasson, M. Nivat, Centers of context-free languages, Internal Report LITP 84-44, 1984.
2. R. Büchi, Regular canonical systems, Archiv für Mathematische Logik und Grundlagenforschung 6 (1964) 91-111 [reprinted in: S. Mac Lane, D. Siefkes (Eds.), The collected works of J. Richard Büchi, Springer, New York, 1990, pp. 317-337].
3. D. Caucal, On the regular structure of prefix rewriting, CAAP 90, in: A. Arnold (Ed.), Lecture Notes in Computer Science, Vol. 431, Springer, Berlin, 1990, pp. 87-102 [a full version is in Theoret. Comput. Sci. 106 (1992) 61-86].
4. D. Caucal, Monadic theory of term rewritings, 7th IEEE Symposium, LICS 92, 1992, pp. 266-273.
5. D. Caucal, Bisimulation of context-free grammars and of pushdown automata, in: A. Ponse, M. de Rijke, Y. Venema (Eds.), CSLI Vol. 53, Modal Logic and Process Algebra, Stanford, 1995, pp. 85-106.
6. Courcelle B. Graph rewriting: an algebraic and logic approach. Leeuwen J. Handbook of Theoretical Computer Science. Vol. B:1990;193-242 Elsevier, Amsterdam.
7. Courcelle B. Monadic second-order definable graph transductions. a survey Theoret. Comput. Sci. 126:1994;53-75.
8. Courcelle B., Walukiewicz I. Monadic second-order logic, graph coverings and unfolding of transition systems. Ann. Pure Appl. Logic. 1:1998;35-62.
9. Muller D., Schupp P. The theory of ends, pushdown automata, and second-order logic. Theoret. Comput. Sci. 37:1985;51-75.
10. Rabin M. A simple method for undecidability proofs and some applications. Bar-Hillel Y. Logic, Methodology and Philosophy of Science. 1965;58-68 North-Holland.
11. Rabin M. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141:1969;1-35.
12. Semenov A. Decidability of monadic theories, MFCS 84. Goos G., Hartmanis J. Lecture Notes in Computer Science. Vol. 176:1984;162-175 Springer, Berlin.
13. Sénizergues G. Formal languages and word-rewriting. Comon H., Jouannaud J.-P. French Sring School of Theoretical Computer Science. Lecture Notes in Computer Science. Vol. 909:1975;75-94 Springer, Berlin.
14. Shelah S. The monadic theory of order. Ann. Math. 102:1975;379-419.
15. J. Stupp, The lattice-model is recursive in the original model, Manuscript, The Hebrew University, 1975.
16. Thomas W. Automata on infinite objects. Leeuwen J. Handbook of Theoretical Computer Science. Vol. B:1990;135-191 Elsevier, Amsterdam.
17. Thomas W. On logics, tilings, and automata, ICALP 91. Albert L., Monien B., Artalejo R. Lecture Notes in Computer Science. Vol. 510:1991;191-231 Springer, Berlin.
18. Thomas W. Languages, automata, and logic. Rozenberg G., Salomaa A. Handbook of Formal Languages. Vol. 3:1997;389-456 Springer, Berlin.
19. D. Caucal, On the transition graphs of Turing machines, MCU 2001, in: M. Margenstern, Y. Rogozhin (Eds.), Lecture Notes in Computer Sciences, Vol. 2055, pp. 177-189, a long version will appear in Theoret. Comput. Sci.