Emptiness problems of eNCE graph languages

DOI10.1006/jcss.1995.1083zbMath0839.68057OpenAlexW2074497380MaRDI QIDQ1908340

Konstantin Skodinis, Egon Wanke

Publication date: 26 February 1996

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/550e1cf5650e48540ff8befd62b25907d0479d76

zbMATH Keywords

graph grammarsedge label neighborhood controlled embedding

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Node replacements in embedding normal form. ⋮ The bounded degree problem for eNCE graph grammars ⋮ The bounded degree problem for non-obstructing eNCE graph grammars ⋮ Finite graph automata for linear and boundary graph languages ⋮ The complexity of the \(K_{n,n}\)-problem for node replacement graph languages

This page was built for publication: Emptiness problems of eNCE graph languages