A normal form problem for unlabeled boundary NLC graph languages

DOI10.1006/INCO.1995.1093MaRDI QIDQ1898472zbMATH OpenOpenAlexFDO

Authors Koichi Yamazaki

Publication date 15 September 1996

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1995.1093

zbMATH Keywords

unlabeled boundary NLC graph languages

Mathematics Subject Classification ID

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

Recommendations

• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Graph theoretic closure properties of the family of boundary NLC graph languages
• Combinatorial properties of boundary NLC graph languages
• scientific article; zbMATH DE number 3890755
• A pumping lemma and the structure of derivations in the boundary NLC graph languages

Cited in

(4)

• A pumping lemma and the structure of derivations in the boundary NLC graph languages
• A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions
• scientific article; zbMATH DE number 1929936 (Why is no real title available?)
• Learning of restricted RNLC graph languages

This page was built for publication: A normal form problem for unlabeled boundary NLC graph languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898472)