On partially ordered graph grammars

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

Volumn 291 LNCS, Issue , 1987, Pages 99-111

  Brandenburg, Franz J ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

Computational complexity; ECE embeddings; ELC; Graph grammars; NLC; Node and edge labeled graphs; Partially orderd graph grammars; PSPACE and NP completeness; Tree graph grammars; Trees

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTEXT SENSITIVE GRAMMARS; DIRECTED GRAPHS; FORMAL LANGUAGES; GRAPHIC METHODS; TREES (MATHEMATICS);

EMBEDDINGS; GRAPH GRAMMAR; LABELED GRAPHS; NP-COMPLETENESS; TREE GRAPH; TREES;

GRAPH THEORY;

EID: 85035030073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18771-5_48     Document Type: Conference Paper

References (26)

1. IJ.J. Aalbersberg, A. Ehrenfeucht and G. Rozenberg, “On the membership problem for regular DNLC grammars”. Discrete Applied Mathematics 13 (1986), 79–85.
2. IJ.J. Aalbersberg, J. Engelfriet and G. Rozenberg, “The complexity of regular DNLC graph languages”. Report 86-03, Rijksuniversiteit Leiden (1986).
3. F. J. Brandenburg, “On the complexity of the membership problem of graph grammars”, in: Proceedings of the Workshop on Graphtheoretic Concepts in Computer Science 83, M.Nagl and J. Perl, eds., Tauner-Verlag Linz (1983), 40–49.
4. V. Claus, H. Ehrig, and G Rozenberg (eds.), “Graph Grammars and their Application to Computer Science and Biology”, Lecture Notes in Computer Science 73 (1980).
5. A. Ehrenfeucht, M. Main and G. Rozenberg, “Restrictions on NLC graph grammars”, Theoret. Comput. Sci 31 (1984), 211–223.
6. M.R. Garey and D.S. Johnson, “Computers and Intractability — A Guide to the Theory of NP Completeness”, Freeman, San Francisco (1979).
7. R.C. Gonzales, J.J. Edwards and M.G. Thomason, “An algorithm for the inference of tree grammars”, Int. J. Comput. Inform. Sci, 5 (1976), 145–164.
8. F. Harary, “Graph Theory”, Addison Wesley, Reading (1969).
9. M.A. Harrison, “Introduction to Formal Language Theory”, Addison Wesley, Reading, (1979).
10. D. Janssens, “Node label controlled graph grammers”, Ph.D. thesis, University of Antwerp, (1983).
11. D. Janssens and G. Rozenberg, “On the structure of node label controlled graph languages”, Information Sciences 20 (1980), 191–216.
12. D. Janssens and G. Rozenberg, “Restrictions, extensions, and variations of NLC grammars”, Information Sciences 20 (1980), 217–244.
13. D. Janssens and G. Rozenberg, “A characterization of context-free string languages by directed node-label controlled graph grammars”, Acta Informatica 16 (1981), 63–85.
14. D. Janssens and G. Rozenberg, “Decision problems for node label controlled graph grammars”, J. Comput. System Sci. 22 (1981), 144–177.
15. D. Janssens and G. Rozenberg, “Graph grammars with neighbourhood-controlled embedding”, Theoret. Comput. Sci. 7 (1982), 55–74.
16. M. Kaul, “Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken”, Technical Report MIP 8610, Universität Passau, (1986).
17. M. Kaul, “Practical applications of precedence graph grammars”, this volume.
18. K.-J. Lange, E. Welzl, “String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing”, Discrete Applied Mathematics 16, 1987, 17–30.
19. H.J. Ludwigs, “Properties of ordered graph grammars”, Lecture Notes in Computer Science 100 (1981), 70–77.
20. M. Nagl, “Graph-Grammatiken Theorie, Implementierung, Anwendungen”, Vieweg Verlag, Braunschweig (1979).
21. G. Rozenberg and E. Welzl, “Boundary NLC graph grammars — basic definitions, normal forms, and complexity”, Inform. and Control 69 (1986), 136–167.
22. G. Rozenberg and E. Welzl, “Graph theoretic closure properties of the family boundary NLC graph languages”, Acta Informatica 23 (1986), 289–309.
23. G. Rozenberg and E. Welzl, “Combinatorial properties of boundary NLC graph languages”, Discrete Applied Mathematics 16 (1987), 59–73.
24. R. Schuster, “Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität” Dissertation, Universität Passau, (1987).
25. Q. Y. Shi and K. S. Fu, “Parsing and translation of (attributed) expansive graph languages for science analysis”, Proc. 6 ICPR, Munich (1982), 684–687.
26. A. O. Slisenko, “Context-free grammars as a tool for describing polynomial-time subclasses of hard problems”, Inform. Process. Letters 14 (1982), 52–56.