Finite languages for the representation of finite graphs

Journal of Computer and System Sciences

Volumn 52, Issue 1, 1996, Pages 170-184

  Ehrenfeucht, Andrzej ^a   Engelfriet, Joost ^b   Rozenberg, Grzegorz ^a,b  

^a UCB 450   (United States)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FINITE AUTOMATA; GRAPH THEORY; HIERARCHICAL SYSTEMS;

FINITE GRAPHS; FINITE LANGUAGES; HIERARCHICAL SPECIFICATION; LANGUAGE CONCATENATION; LEXICOGRAPHIC METHOD;

FORMAL LANGUAGES;

EID: 0030084057     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0013     Document Type: Article

References (32)

1. G. S. Adhar and S. Peng, Parallel algorithms for cographs; recognition and applications, in "Proceedings, WADS '89" (F. Dehne, J.-R. Sack, and N. Santoro, Eds.), Lecture Notes in Computer Science Vol. 382, pp. 335-351, Springer-Verlag, Berlin, 1989.
2. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey, BIT 25 (1985), 2-23.
3. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340.
4. H. L. Bodlaender and R. H. Möhring, The pathwidth and treewidth of cographs, in "Proceedings, SWAT 90" (J. R. Gilbert and R. Karlsson, Eds.), Lecture Notes in Computer Science, Vol. 447, pp. 301-309, Springer-Verlag, Berlin, 1990.
5. J. A. Brzozowski, Derivatives of regular expressions, J. Assoc. Comput. Mach. 11 (1964), 481-494.
6. H. Buer and R. H. Möhring, A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res. 8 (1983), 170-184.
7. D. G. Corneil, H. Lerchs, and L. Stewart Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981), 163-174.
8. B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987), 141-181.
9. B. Courcelle, The monadic second-order logic of graphs. II. Infinite graphs of bounded width, Math. Systems Theory 21 (1989), 187-221.
10. B. Courcelle, The monadic second-order logic of graphs. III. Tree-width, forbidden minors, and complexity issues, RAIRO Inform. Théor. Appl. 26 (1992), 257-286.
11. A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures. Part I. Clans, basic subclasses, and morphisms, Theoret. Comput. Sci. 70 (1990), 277-303.
12. A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures. Part II. Representation through labeled tree families, Theoret. Comput. Sci. 70 (1990), 305-342.
13. A. Ehrenfeucht and G. Rozenberg, Primitivity is hereditary for 2-structures, Theoret. Comput. Sci. 70 (1990), 343-358.
14. H. Ehrig, H.-J. Kreowski, and G. Rozenberg (Eds.), "Graph Grammars and their Application to Computer Science," Lecture Notes in Computer Science, Vol. 532, Springer-Verlag, Berlin, 1991.
15. S. Eilenberg, "Automata, Languages, and Machines," Vol. A, Academic Press, New York, 1974.
16. J. Engelfriet, Context-free NCE graph grammars, in "Proceedings, FCT'89" (J. Csirik, J. Demetrovics, and F. Gécseg, Eds.), Lecture Notes in Computer Science, Vol. 380, pp. 148-161, Springer-Verlag, Berlin, 1989.
17. J. Engelfriet, T. Harju, A. Proskurowski, and G. Rozenberg, "Characterization and Complexity of Uniformly Non-primitive Labeled 2-Structures," Report 94-31, Leiden University, 1994; Theoret. Comput. Sci., to appear.
18. J. Engelfriet, T. Harju, A. Proskurowski, and G. Rozenberg, "Characterization and Complexity of Uniformly Non-primitive Labeled 2-Structures," Report 94-31, Leiden University, 1994; Theoret. Comput. Sci., to appear.
19. J. Engelfriet and G. Rozenberg, Graph grammars based on node rewriting: An introduction to NLC graph grammars, in [EhrKreRoz pp. 12-23].
20. M. C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, San Diego, 1980.
21. F. Harary, "Graph theory," Addison-Wesley, Reading, MA, 1969.
22. J. E. Hopcroft and J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA, 1979.
23. D. Janssens and G. Rozenberg, Neighbourhood-uniform NLC grammars, Comput. Vision Graphics Image Process. 35 (1986), 131-151.
24. R. H. Möhring and F. J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Ann. Discrete Math. 19 (1984), 257-356.
25. D. E. Muller and P. E. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoret. Comput. Sci. 37 (1985), 51-75.
26. J. H. Muller and J. Spinrad, Incremental modular decomposition, J. Assoc. Comput. Mach. 36 (1989), 1-19.
27. M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop. 3 (1959), 114-125.
28. N. Robertson and P. Seymour, Graph Minors. II. Algorithmic aspects of tree-width, J. Algorithms 7 (1986), 309-322.
29. G. Sabidussi, The composition of graphs, Duke Math. J. 26 (1959), 693-696.
30. G. Sabidussi, The lexicographic product of graphs, Duke Math. J. 28 (1961), 573-578.
31. G. Sabidussi, Graph derivatives, Math. Z. 76 (1961), 385-401.
32. J. Valdez, R. E. Tarjan, and E. Lawler, The recognition of series parallel digraphs, SIAM J. Comput. 11 (1982), 298-313.