Metatheorems for decision problems on hyperedge replacement graph languages
- 1 September 1989
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 26 (7) , 657-677
- https://doi.org/10.1007/bf00288976
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On graph rewriting systems (Graph-Grammars)Published by Springer Nature ,2005
- On context-free graph languages generated by edge replacementPublished by Springer Nature ,2005
- Decomposition trees: Structured graph representation and efficient algorithmsPublished by Springer Nature ,2005
- Some structural aspects of hypergraph languages generated by hyperedge replacementPublished by Springer Nature ,2005
- Decidable boundedness problems for hyperedge-replacement graph grammarsPublished by Springer Nature ,1989
- On context-free sets of graphs and their monadic second-order theoryPublished by Springer Nature ,1987
- May we introduce to you: Hyperedge replacementPublished by Springer Nature ,1987
- Characteristics of graph languages generated by edge replacementTheoretical Computer Science, 1987
- The bounded degree problem for NLC grammars is decidableJournal of Computer and System Sciences, 1986
- Graph-Grammars and Their Application to Computer Science and BiologyPublished by Springer Nature ,1979