scientific article
From MaRDI portal
Publication:3219131
zbMath0555.68042MaRDI QIDQ3219131
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (05C99)
Related Items (7)
Combinatorial properties of boundary NLC graph languages ⋮ String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting ⋮ The bounded degree problem for NLC grammars is decidable
This page was built for publication:
