On the structure of node-label-controlled graph languages
From MaRDI portal
Cites work
Cited in
(54)- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Complexity of boundary graph languages
- Parallel high-level replacement systems
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Edge-label controlled graph grammars
- Node-label controlled graph grammars with context conditions
- Graph grammars with path-controlled embedding
- \(k\)-NLC graphs and polynomial algorithms
- On switching classes, NLC-width, cliquewidth and treewidth
- On the interleaving semantics of transformation units -- a step into GRACE
- Node replacement graph grammars with dynamic node relabeling
- Eigenvalue location in graphs of small clique-width
- Graph grammars according to the type of input and manipulated data: a survey
- Processes and local actions
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- The bounded degree problem for NLC grammars is decidable
- On the structure of linear apex NLC graph grammars
- Single pushout transformations of equationally defined graph structures with applications to actor systems
- Nonterminal separation in graph grammars
- Restrictions, extensions, and variations of NLC grammars
- Decision problems for node label controlled graph grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Boundary graph grammars with dynamic edge relabeling
- Separation results for separated apex NLC and NCE graph languages
- Exponential time analysis of confluent and boundary eNCE graph languages
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- Power properties of NLC graph grammars with a polynomial membership problem
- Handle-rewriting hypergraph grammars
- Separating \(k\)-separated eNCE graph languages
- A hierarchy of eNCE families of graph languages
- Node rewriting in graphs and hypergraphs: A categorical framework
- A pumping lemma and the structure of derivations in the boundary NLC graph languages
- The generating power of boundary NLC graph grammars and cycle graphs
- The bounded degree problem for non-obstructing eNCE graph grammars
- Fundamental methodological issues of syntactic pattern recognition
- Characteristics of graph languages generated by edge replacement
- The complexity of connectivity problems on context-free graph languages
- Linear graph grammars: Power and complexity
- Parsing of edNLC-graph grammars for scene analysis
- Results of NLC grammars with one-letter terminal alphabets
- Restrictions on NLC graph grammars
- Learning of restricted RNLC graph languages
- Handle NLC grammars and r. e. languages
- Nonterminal bounded NLC graph grammars
- Note on node-rewriting graph grammars
- Finite graph automata for linear and boundary graph languages
- Representing graph families with edge grammars
- The bounded degree problem for eNCE graph grammars
- Pullback rewriting and applications
- Generating irregular partitionable data structures
- Graph theoretic closure properties of the family of boundary NLC graph languages
- Combinatorial properties of boundary NLC graph languages
- A uniform approach to graph rewriting: The pullback approach
- Node rewriting in hypergraphs
This page was built for publication: On the structure of node-label-controlled graph languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148687)
