An internal presentation of regular graphs by prefix-recognizable graphs

Theory of Computing Systems

Volumn 34, Issue 4, 2001, Pages 299-336

  Caucal, D ^a   Knapik, T ^b  

^a CAMPUS DE BEAULIEU   (France)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; GRAPHIC METHODS;

GRAPH-THEORETIC; HYPEREDGE REPLACEMENT; INFINITE GRAPH; INFINITE SYSTEM; MONADIC SECOND ORDER THEORY; PREFIX-RECOGNIZABLE GRAPHS; REGULAR GRAPHS; SPECIFICATION AND VERIFICATION;

GRAPH THEORY;

EID: 0035640229     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-001-1015-5     Document Type: Article

References (35)

1. K. Barthelmann. On equational simple graphs. Technical Report 9/97, Johannes Gutenberg Universität, Mainz, 1998.
2. K. Barthelmann. When can an equational simple graph be generated by hyperedge replacement. In L. Brim, J. Gruska, and J. Zlatuska, editors, Mathematical Foundations of Computer Science. LNCS 1450, pages 543-552. Springer-Verlag, Berlin, 1998.
3. K. Barthelmann. When can an equational simple graph be generated by hyperedge replacement. Technical Report 2/98, Johannes Gutenberg Universität, Mainz, 1998.
4. J. Berstel. Transductions and Context-Free Languages. Teubner, Stuttgart, 1979.
5. J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlag. Math., 6:66-92, 1960.
6. H. Calbrix and T. Knapik. A string-rewriting characterization of Muller and Shupp's context-free graphs. In V. Arvind and R. Ramanujam, editors, Proceedings of the 18th International Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, Dec. 1998. LNCS 1530, pages 331-342. Springer-Verlag, Berlin, 1998.
7. D. Caucal. On the regular structure of prefix rewriting. Theoret. Comput. Sci., 106:61-86, 1992.
8. D. Caucal. Bisimulation of context-free grammars and pushdown automata. In A. Ponse, M. de Rijke, and Y. Venema, editors, Modal Logic and Process Algebra. A Bisimulation Perspective, CSLI Lecture Notes No. 53, pages 85-106. Stanford, 1995.
9. D. Caucal. On infinite transition graphs having a decidable monadic second-order theory. In F. M. auf der Heide and B. Monien, editors, Proceedings of the 23rd International Colloquium on Automata Languages and Programming. LNCS 1099, pages 194-205. Springer-Verlag, Berlin, 1996. A long version will appear in Theoret. Comput. Sci.
10. D. Caucal. On infinite transition graphs having a decidable monadic second-order theory. In F. M. auf der Heide and B. Monien, editors, Proceedings of the 23rd International Colloquium on Automata Languages and Programming. LNCS 1099, pages 194-205. Springer-Verlag, Berlin, 1996. A long version will appear in Theoret. Comput. Sci.
11. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, May 1981. LNCS 131, pages 52-71. Springer-Verlag, Berlin, 1981.
12. B. Courcelle. The monadic second-order logic of graphs, II: Infinite graphs of bounded width. Math. Systems Theory, 21:187-221, 1989.
13. B. Courcelle. The monadic second-order logic of graphs, IV: Definability properties of equational graphs. Ann. Pure Appl. Logic, 49:193-255, 1990.
14. B. Courcelle. Recursive applicative program schemes. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 459-492. Elsevier, Amsterdam, 1990.
15. B. Courcelle. The monadic second-order logic of graphs, III: Tree-decompositions, minors and complexity issues. RAIRO Inform. Théor. Appl., 26(3):257-286, 1992.
16. B. Courcelle. The monadic second-order logic of graphs, VII: Graphs as relational structures. Theoret. Comput. Sci., 101:3-33, 1992.
17. B. Courcelle. Structural properties of context-free sets of graphs generated by vertex replacement. Inform. and Comput., 116(2):275-293, 1995.
18. B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, pages 313-400. World Scientific, Singapore, 1997.
19. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. J. Comput. System Sci., 46(2):218-270, 1993.
20. J. Engelfriet. Graph grammars and tree transducers. In S. Tison, editor, Trees in Algebra and Programming - CAAP '94, Edinburgh, Apr. 1994. LNCS 787, pages 15-36. Springer-Verlag, Berlin, 1994.
21. A. Habel. Hyperedge Replacement: Grammars and Languages. LNCS 643. Springer-Verlag, Berlin, 1992.
22. D. Harel. Towards a theory of recursive structures. In L. Brim, J. Gruska, and J. Zlatuska, editors, Mathematical Foundations of Computer Science, Brno, Aug. 1998. LNCS 1450, pages 36-53. Springer-Verlag, Berlin, 1998.
23. H. Hungar. Beyond finite-state model checking: verifying large and infinite systems. Habilitation, Carl von Ossietzky Universität Oldenburg, 1998.
24. H. Hungar. Model checking and higher-order recursion. In M. Kutylowski and L. Pacholski, editors, Mathematical Foundations of Computer Science, Szklarska Poreba, Sept. 1999.
25. T. Kloks. Treewidth - Computations and Approximations. LNCS 842. Springer-Verlag, Berlin, 1994.
26. 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, Auckland, Jan. 1999, pages 273-285. Springer-Verlag, New York, 1999.
27. T. Knapik and H. Calbrix. Thue specifications and their monadic second-order properties. Fund. Inform., 39(3):305-325, 1999.
28. D. Kozen. Results on the prepositional μ-calculus. Theoret. Comput. Sci., 27:333-354, 1983.
29. C. Lautemann. Decomposition trees: structured graph representation and efficient algorithms. In M. Dauchet and M. Nivat, editors, CAAP '88, Proceedings of the 13th Colloquium on Trees in Algebra and Programming, Nancy, Mar. 1988. LNCS 299. Springer-Verlag, Berlin, 1988.
30. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata and second-order logic. Theoret. Comput. Sci., 37:51-75, 1985.
31. N. Robertson and P. Seymour. Graph minors, IV: Tree-width and well-quasi-ordering. J. Combin. Theory Ser. B. 48:227-254, 1990.
32. G. Sénizergues. Decidability of the bisimulation problem for equational graphs of finite out-degree. In R. Motwani, editor, Proceedings FOCS '98, pages 120-129. IEEE Computer Society Press, Rockville, MD, 1998. Full proofs in Γ (A) ∼ Γ (B)?, Technical Report 1183-97 of LaBRI, pages 1-113.
33. 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, Amsterdam, 1990.
34. S. L. Torre and M. Napoli. Representing hyper-graphs by regular languages. In L. Brim, J. Gruska, and J. Zlatuska, editors, Mathematical Foundations of Computer Science, Brno, Aug. 1998. LNCS 1450, pages 571-579. Springer-Verlag, Berlin, 1998.
35. S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Word, Language, Grammar, volume 1 of Handbook of Formal Languages, pages 41-110. Springer-Verlag, New York, 1997.