A string-rewriting characterization of muller and schupp's context-free graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1530 LNCS, Issue , 1998, Pages 331-342

  Calbrix, Hugues ^a   Knapik, Teodor ^b  

^a College Jean Lecanuet ^*  (France)

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

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS; CONTEXT-FREE; EXPRESSIVE POWER; INFINITE GRAPH;

SOFTWARE ENGINEERING;

SPECIFICATIONS;

EID: 84887049860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_31     Document Type: Conference Paper

References (17)

1. K. Barthelmann. On equational simple graphs. Technical Report 9/97, Johannes Gutenberg Universität, Mainz, 1997. 333, 341
2. R. V. Book and F. Otto. String-Rewriting Systems. Texts and Monographs in Computer Science. Springer-Verlag, 1993. 332, 335
3. H. Calbrix and T. Knapik. On a class of graphs of semi-Thue systems having decidable monadic second-order theory. Technical Report INF/1998/01/01/a, IREMIA, Université de la Réunion, 1998. 341
4. D. Caucal. On the regular structure of prefix rewriting. Theoretical Comput. Sci., 106:61-86, 1992. 331, 333, 339 (Pubitemid 23605842)
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. 331, 341 (Pubitemid 126097567)
6. B. Courcelle. The monadic second-order logic of graphs, II: Infinite graphs of bounded width. Mathematical System Theory, 21:187-221, 1989. 333
7. 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. 341
8. B. Courcelle. The monadic second-order theory of graphs IX: Machines and their behaviours. Theoretical Comput. Sci., 151:125-162, 1995. 341
9. J. Engelfriet. Contex-free graph grammars. In G. Rozenberg and A. Salomaa, editors, Beyond Words, volume 3 of Handbook of Formal Languages, pages 125- 213. Springer-Verlag, 1997. 331
10. J. A. Goguen, J. W. Thatcher, and E. G. Wagner. An initial approach to the specification, correctness and implementation of abstract data types. In R. T. Yeh, editor, Data Structuring, volume 4 of Current Trends in Programming Methodology, pages 80-149. Prentice Hall, 1978. 334
11. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979. 332, 337
12. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata and second-order logic. Theoretical Comput. Sci., 37:51-75, 1985. 331, 333, 339
13. 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. 340, 341
14. G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages, volume 1. Springer-Verlag, 1997. 332
15. G. Sénizergues. Formal languages and word rewriting. In Term Rewriting: French Spring School of Theoretical Computer Science, LNCS 909, pages 75-94, Font- Romeu, May 1993. 331, 335
16. C. C. Squier, F. Otto, and Y. Kobayashi. A finiteness condition for rewriting systems. Theoretical Comput. Sci., 131(2):271-294, 1994. 331
17. A. Thue. Probleme über veränderungen von zeichenreihen nach gegebenen regeln. Skr. Vid. Kristiania, I Mat. Natuv. Klasse, 10:34 pp, 1914. 331