Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
From MaRDI portal
Publication:3747744
Recommendations
Cited in
(65)- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- Equational reasoning with context-free families of string diagrams
- Learning of restricted RNLC graph languages
- Graph-theoretic properties compatible with graph derivations
- On the regularity and learnability of ordered DAG languages
- scientific article; zbMATH DE number 3890755 (Why is no real title available?)
- A normal form problem for unlabeled boundary NLC graph languages
- On structured graph grammars. I
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Context-free graph languages of bounded degree are generated by apex graph grammars
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- scientific article; zbMATH DE number 4051027 (Why is no real title available?)
- The bounded degree problem for NLC grammars is decidable
- Monadic second-order definable graph transductions: a survey
- scientific article; zbMATH DE number 4049102 (Why is no real title available?)
- Node replacements in embedding normal form.
- scientific article; zbMATH DE number 4049100 (Why is no real title available?)
- Power properties of NLC graph grammars with a polynomial membership problem
- A pumping lemma and the structure of derivations in the boundary NLC graph languages
- The bounded degree problem for eNCE graph grammars
- Restrictions on NLC graph grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Undecidability of the bandwidth problem on linear graph languages
- The complexity of regular DNLC graph languages
- scientific article; zbMATH DE number 3885330 (Why is no real title available?)
- The generating power of boundary NLC graph grammars and cycle graphs
- Separating \(k\)-separated eNCE graph languages
- Neighborhood-uniform NLC grammars
- Order independent NCE grammars recognized in polynomial time
- Hypergraph languages of bounded degree
- On the structure of linear apex NLC graph grammars
- Graph automata for linear graph languages
- Graph theoretic closure properties of the family of boundary NLC graph languages
- On the membership problem for regular DNLC grammars
- Edge-label controlled graph grammars
- Combinatorial properties of boundary NLC graph languages
- Handle NLC grammars and r. e. languages
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- Metatheorems for decision problems on hyperedge replacement graph languages
- The complexity of graph languages generated by hyperedge replacement
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Linear graph grammars: Power and complexity
- On the structure of recognizable languages of dependence graphs
- Algorithms for graph problems on BNLC structured garphs
- Complexity of boundary graph languages
- Handle-rewriting hypergraph grammars
- Nonterminal bounded NLC graph grammars
- Boundary graph grammars with dynamic edge relabeling
- Double Greibach operator grammars
- Node replacement graph grammars with dynamic node relabeling
- Automatic graphs and D0L-sequences of finite graphs
- Logical description of context-free graph languages
- A hierarchy of eNCE families of graph languages
- Quasi-rocking real-time pushdown automata
- scientific article; zbMATH DE number 3872712 (Why is no real title available?)
- Separation results for separated apex NLC and NCE graph languages
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- On hyperedge replacement and BNLC graph grammars
- Finite graph automata for linear and boundary graph languages
- Nonterminal separation in graph grammars
- scientific article; zbMATH DE number 4060748 (Why is no real title available?)
- scientific article; zbMATH DE number 3943059 (Why is no real title available?)
- scientific article; zbMATH DE number 219258 (Why is no real title available?)
This page was built for publication: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747744)
