On the structure of node-label-controlled graph languages
From MaRDI portal
Publication:1148687
DOI10.1016/0020-0255(80)90038-9zbMath0452.68073MaRDI QIDQ1148687
Grzegorz Rozenberg, Dirk Janssens
Publication date: 1980
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(80)90038-9
68Q45: Formal languages and automata
Related Items
Separation results for separated apex NLC and NCE graph languages, Node rewriting in graphs and hypergraphs: A categorical framework, The bounded degree problem for NLC grammars is decidable, Note on node-rewriting graph grammars, Nonterminal separation in graph grammars, Boundary graph grammars with dynamic edge relabeling, Results of NLC grammars with one-letter terminal alphabets, Edge-label controlled graph grammars, A comparison of boundary graph grammars and context-free hypergraph grammars, Restrictions on NLC graph grammars, Graph theoretic closure properties of the family of boundary NLC graph languages, Combinatorial properties of boundary NLC graph languages, String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing, Handle NLC grammars and r. e. languages, Characteristics of graph languages generated by edge replacement, Nonterminal bounded NLC graph grammars, Parsing of edNLC-graph grammars for scene analysis, Power properties of NLC graph grammars with a polynomial membership problem, Restrictions, extensions, and variations of NLC grammars, Decision problems for node label controlled graph grammars, Graph grammars with path-controlled embedding, Separating \(k\)-separated eNCE graph languages, A pumping lemma and the structure of derivations in the boundary NLC graph languages, The complexity of connectivity problems on context-free graph languages, \(k\)-NLC graphs and polynomial algorithms, The generating power of boundary NLC graph grammars and cycle graphs, The bounded degree problem for eNCE graph grammars, Parallel high-level replacement systems, A hierarchy of eNCE families of graph languages, Generating irregular partitionable data structures, Finite graph automata for linear and boundary graph languages, Representing graph families with edge grammars, Linear graph grammars: Power and complexity, The complexity of the \(K_{n,n}\)-problem for node replacement graph languages, HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting, Handle-rewriting hypergraph grammars, Node-label controlled graph grammars with context conditions, Complexity of boundary graph languages
Cites Work
