When can an equational simple graph be generated by hyperedge replacement?

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

Volumn 1450 LNCS, Issue , 1998, Pages 543-552

  Barthelmann, Klaus ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; TREES (MATHEMATICS);

BIPARTITE GRAPHS; CANONICAL SOLUTIONS; CONTEXT-FREE; FINITE TREES; HYPER GRAPH; HYPEREDGE REPLACEMENT; RECURSIVE EQUATIONS;

TREES (MATHEMATICS); GRAPH THEORY;

EID: 84896779895     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055804     Document Type: Conference Paper

References (23)

1. Adámek, J., Koubek, V.: Least Fixed Point of a Functor. J. Comput. System Sci. 19 (1979) 163-178
2. Barthelmann, K.: How to Construct a Hyperedge Replacement System for a Context-Free Set of Hypergraphs. Tech. Rep. 7, Universität Mainz, Institut für Informatik (1996). Submitted for publication
3. Barthelmann, K.: On Equational Simple Graphs. Tech. Rep. 9, Universität Mainz, Institut für Informatik (1997). Submitted for publication
4. Barthelmann, K.: When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?. Tech. Rep. 2, Universität Mainz, Institut für Informatik (1998)
5. Bauderon, M.: Infinite hypergraphs I. Basic properties. Theoret. Comput. Sci. 82 (1991) 177-214
6. Bauderon, M.: Infinite hypergraphs II. Systems of recursive equations. Theoret. Comput. Sci. 103 (1992) 165-190
7. Bauderon, M., Courcelle, B.: Graph Expressions and Graph Rewritings. Math. Systems Theory 20 (1987) 83-127
8. Caucal, D.: On the regular structure of prefix rewriting. Theoret. Comput. Sci. 106 (1992) 61-86
9. Caucal, D.: On Infinite Transition Graphs Having a Decidable Monadic Theory. In: auf der Heide, F. M., Monien, B. (eds.): Automata, Languages and Programming (ICALP '96), Lecture Notes in Computer Science, Vol. 1099. Springer (1996) 194-205
10. Courcelle, B.: Fundamental properties of infinite trees. Theoret. Comput. Sci. 25 (1983) 95-169
11. Courcelle, B.: The Monadic Second-Order Logic of Graphs, II: Infinite Graphs of Bounded Width. Math. Systems Theory 21 (1989) 187-221
12. Courcelle, B.: Graph Rewriting: An Algebraic and Logic Approach. In: van Leeuwen [23], Ch. 5, 193-242
13. Courcelle, B.: The monadic second-order logic of graphs IV: Definability properties of equational graphs. Ann. Pure Appl. Logic 49 (1990) 193-255
14. Courcelle, B.: The monadic second-order logic of graphs III: Tree-decompositions, minors and complexity issues. RAIRO Informatique théorique et Applications/ Theoretical Informatics and Applications 26, 3 (1992) 257-286
15. Courcelle, B.: The monadic second-order logic of graphs VII: Graphs as relational structures. Theoret. Comput. Sci. 101 (1992) 3-33
16. Courcelle, B.: Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement. Inform, and Comput. 116 (1995) 275-293
17. Courcelle, B.: The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. In: Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1, Foundations. World Scientific (1997) Ch. 5, 313-400
18. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-Rewriting Hypergraph Grammars. J. Comput. System Sci. 46 (1993) 218-270
19. Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109 (1993) 49-82
20. Engelfriet, J.: Context-Free Graph Grammars. In: Rozenberg and Salomaa [22], Ch. 3, 125-213
21. Muller, D. E., Schupp, P. E.: The theory of ends, pushdown automata, and second-order logic. Theoret. Comput. Sci. 37 (1985) 51-75
22. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 3, Beyond Words. Springer (1997)
23. van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics. Elsevier (1990)