scientific article
From MaRDI portal
Publication:3787507
zbMath0644.68097MaRDI QIDQ3787507
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NLC graph grammarscomplexity of node rewriting graph grammarsfinite Church-Rosser propertynode and edge label controlled
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Handle-rewriting hypergraph grammars, The monadic second order logic of graphs. VI: On several representations of graphs by relational structures, The equivalence of boundary and confluent graph grammars on graph languages of bounded degree, Logical description of context-free graph languages, The complexity of regular DNLC graph languages, Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence, Finite graph automata for linear and boundary graph languages, A Greibach normal form for context-free graph grammars, Hypergraph languages of bounded degree
