A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions

DOI10.1007/s002360050087zbMath0865.68073OpenAlexW2001385395MaRDI QIDQ1920234

Koichi Yamazaki

Publication date: 19 June 1997

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050087

zbMATH Keywords

graph grammarsdecomposition treederivation treesapex NLC graph languages

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

This page was built for publication: A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions