Decidable boundedness problems for hyperedge-replacement graph grammars

This publication has 15 references indexed in Scilit:

• A pumping lemma for context-free graph languages
  Published by Springer Nature ,2005
• On context-free graph languages generated by edge replacement
  Published by Springer Nature ,2005
• Some structural aspects of hypergraph languages generated by hyperedge replacement
  Published by Springer Nature ,2005
• Problems easy for tree-decomposable graphs extended abstract
  Published by Springer Nature ,1988
• Graph expressions and graph rewritings
  Theory of Computing Systems, 1987
• On context-free sets of graphs and their monadic second-order theory
  Published by Springer Nature ,1987
• May we introduce to you: Hyperedge replacement
  Published by Springer Nature ,1987
• Characteristics of graph languages generated by edge replacement
  Theoretical Computer Science, 1987
• The bounded degree problem for NLC grammars is decidable
  Journal of Computer and System Sciences, 1986
• Context-free graph grammars
  Information and Control, 1978