The generating power of boundary NLC graph grammars and cycle graphs

DOI10.1016/0020-0255(94)90061-2zbMath0820.68068OpenAlexW2034838383MaRDI QIDQ1338850

Koichi Yamazaki

Publication date: 27 August 1995

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(94)90061-2

zbMATH Keywords

graph grammargraph language

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

A pumping lemma and the structure of derivations in the boundary NLC graph languages

Cites Work

• Unnamed Item
• Unnamed Item
• The bounded degree problem for NLC grammars is decidable
• Restrictions on NLC graph grammars
• Graph theoretic closure properties of the family of boundary NLC graph languages
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
• Parallel concepts in graph theory
• A pumping lemma and the structure of derivations in the boundary NLC graph languages
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Linear and Context-Free Graph Grammars

This page was built for publication: The generating power of boundary NLC graph grammars and cycle graphs