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

DOI10.1016/0020-0255(93)90114-2zbMath0820.68065OpenAlexW2018415834WikidataQ125020224 ScholiaQ125020224MaRDI QIDQ1328510

Takeo Yaku, Koichi Yamazaki

Publication date: 26 July 1994

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

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

zbMATH Keywords

BNLC graph grammarspumped graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

The generating power of boundary NLC graph grammars and cycle graphs

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
• Parallel concepts in graph theory
• The generating power of boundary NLC graph grammars and cycle graphs
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Linear and Context-Free Graph Grammars

This page was built for publication: A pumping lemma and the structure of derivations in the boundary NLC graph languages