Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
- 21 October 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 89 (1) , 33-62
- https://doi.org/10.1016/0304-3975(90)90106-r
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Metatheorems for decision problems on hyperedge replacement graph languagesActa Informatica, 1989
- Graph expressions and graph rewritingsTheory of Computing Systems, 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
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexityInformation and Control, 1986
- Graph theoretic closure properties of the family of boundary NLC graph languagesActa Informatica, 1986
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problemsInformation Processing Letters, 1982
- Context-free graph grammarsInformation and Control, 1978