Node replacement graph languages squeezed with chains, trees, and forests

DOI10.1006/inco.1995.1029zbMath0828.68092OpenAlexW2005776846MaRDI QIDQ1891164

Yanyan Li

Publication date: 28 May 1995

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

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

zbMATH Keywords

graph grammarsgraph languages

Mathematics Subject Classification ID

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

Related Items (6)

A hierarchy of eNCE families of graph languages ⋮ On the structure of linear apex NLC graph grammars ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ Quasi-rocking real-time pushdown automata ⋮ Separation results for separated apex NLC and NCE graph languages ⋮ Double Greibach operator grammars

This page was built for publication: Node replacement graph languages squeezed with chains, trees, and forests