Metatheorems for decision problems on hyperedge replacement graph languages
From MaRDI portal
Publication:1121675
DOI10.1007/BF00288976zbMath0674.68047MaRDI QIDQ1121675
Walter Vogler, Hans-Joerg Kreowski, Annegret Habel
Publication date: 1989
Published in: Acta Informatica (Search for Journal in Brave)
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
Related Items
Unnamed Item, Separation results for separated apex NLC and NCE graph languages, Metatheorems for decision problems on hyperedge replacement graph languages, The complexity of connectivity problems on context-free graph languages, Logical description of context-free graph languages, A comparison of compatible, finite, and inductive graph properties, HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
Cites Work
- The bounded degree problem for NLC grammars is decidable
- Graph theoretic closure properties of the family of boundary NLC graph languages
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Characteristics of graph languages generated by edge replacement
- Metatheorems for decision problems on hyperedge replacement graph languages
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
- Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
- Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
