The monadic second-order logic of graphs X: Linear orderings

Theoretical Computer Science

Volumn 160, Issue 1-2, 1996, Pages 87-143

  Courcelle, Bruno ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; DATA STRUCTURES; FORMAL LOGIC; SET THEORY;

DEPENDENCY GRAPHS; LINEAR ORDERINGS; MONADIC SECOND ORDER LOGIC; RELATIONAL STRUCTURES;

GRAPH THEORY;

EID: 0030169923     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00083-6     Document Type: Article

References (25)

1. I. Aalbersberg and G. Rozenberg, Theory of traces, Theoret. Comput. Sci. 60 (1988) 1-82.
2. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
3. R. Cori, Y. Metivier and W. Zielonka, Asynchronous mappings and asynchronous cellular automata, Inform. and Comput. 106 (1993) 159-203.
4. D. Corneil, H. Lerchs and L. Stewart, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
5. B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987) 141-181.
6. B. Courcelle, The monadic second-order logic of graphs I: recognizable sets of finite graphs. Inform. and Comput. 85 (1990) 12-75.
7. B. Courcelle, The monadic second-order logic of graphs V: on closing the gap between definability and recognizability, Theoret. Comput. Sci. 80 (1991) 153-202.
8. B. Courcelle, The monadic second order logic of graphs VII: graphs as relational structures, Theoret. Comput. Sci. 101 (1992) 3-33.
9. B. Courcelle, The monadic second-order logic of graphs VIII: orientations, Ann. Pure Appl. Logic 72 (1995) 103-143.
10. B. Courcelle, The monadic second-order logic of graphs VI: on several representations of graphs by relational structures, Discrete Appl. Math. 54 (1994) 117-149.
11. B. Courcelle, Monadic second-order definable graph transductions: a survey, Theoret. Comput. Sci. 126 (1994) 53-75.
12. B. Courcelle, Recognizable sets of graphs: equivalent definitions and closure properties, Math. Struct. Comput. Sci. 4 (1994) 1-32.
13. B. Courcelle, Structural properties of context-free sets of graphs generated by vertex-replacement, Inform. and Comput. 116 (1995) 275-293.
14. A. Cournier and M. Habib, A new linear algorithm for modular decomposition, in: Proc. CAAP '94, Lecture Notes in Computer Science, Vol. 787 (Springer, Berlin, 1994) 68-94.
15. W. Ebinger and A. Muscholl, Logical definability of infinite traces, in: Proc. ICALP '93, Lecture Notes in Computer Science, Vol. 700 (Springer, Berlin, 1993) 335-346.
16. F. Gecseg and M. Steinby, Tree Automata (Academiai Kiado, Budapest, 1984).
17. L. Hella, P. Kolaitis and K. Luosto, How to define a linear order on finite models, in: Proc. IEEE Symp. Logic in Computer Science (1994).
18. H. Hoogeboom and P. ten Pas, Recognizable text languages, in: MFCS 1994, Lecture Notes in Computer Science, Vol. 841 (Springer, Berlin, 1994) 413-422.
19. E. Ochmanski, Regular behaviour of concurrent systems, Bull. EATCS 27 (1985) 56-67.
20. A. Potthof and W. Thomas, Regular tree languages without unary symbols are star-free, in: Proc. FCT '93, Lecture Notes in Computer Science, Vol. 710 (Springer, Berlin, 1993) 396-405.
21. A. Proskurowski, Separating subgraphs in k-trees: cables and caterpillars, Discrete Math. 49 (1984) 275-285.
22. D. Sumner, Graphs indecomposable with respect to the X-join, Discrete Math. 6 (1973) 281-298.
23. W. Thomas, Logical aspects of the study of tree languages, in: B. Courcelle, ed., Proc. 9th Colloq. on Trees in Algebra and Programming (CAAP) (Cambridge Univ. Press, Cambridge, 1984) 31-49.
24. W. Thomas, Automata on infinite objects, in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 133-192.
25. W. Thomas, On logical definability of trace languages, in: V. Diekert, ed., Proceedings of a workshop held in Kochel in October 1989, Report of Technische Universität München I-9002 (1990) 172-182.