Emptiness problems of eNCE graph languages

DOI10.1006/JCSS.1995.1083MaRDI QIDQ1908340zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The bounded degree problem for eNCE graph grammars
• Linear graph grammars: Power and complexity
• A hierarchy of eNCE families of graph languages
• The bounded degree problem for non-obstructing eNCE graph grammars
• scientific article; zbMATH DE number 1107740

Cited in

(7)

• The bounded degree problem for non-obstructing eNCE graph grammars
• Exponential time analysis of confluent and boundary eNCE graph languages
• Node replacements in embedding normal form.
• The emptiness problem for valence automata over graph monoids
• The bounded degree problem for eNCE graph grammars
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
• Finite graph automata for linear and boundary graph languages

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

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