Results of NLC grammars with one-letter terminal alphabets

DOI10.1016/0304-3975(90)90179-LzbMath0694.68051OpenAlexW2036033603MaRDI QIDQ909481

Michael G. Main, Jochen Hoffmann

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90179-l

zbMATH Keywords

graph grammarsgraph languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restrictions on NLC graph grammars
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• A characterization of context-free string languages by directed node- label controlled graph grammars
• Decision problems for node label controlled graph grammars
• Graph grammars with neighbourhood-controlled embedding

This page was built for publication: Results of NLC grammars with one-letter terminal alphabets