Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
From MaRDI portal
Publication:3747744
DOI10.1016/S0019-9958(86)80045-6zbMATH Open0608.68060DBLPjournals/iandc/RozenbergW86OpenAlexW2061817376WikidataQ54309887 ScholiaQ54309887MaRDI QIDQ3747744FDOQ3747744
Authors: Grzegorz Rozenberg, Emo Welzl 
Publication date: 1986
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(86)80045-6
Recommendations
Cited In (65)
- Equational reasoning with context-free families of string diagrams
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- A normal form problem for unlabeled boundary NLC graph languages
- Graph-theoretic properties compatible with graph derivations
- Learning of restricted RNLC graph languages
- Title not available (Why is that?)
- On the regularity and learnability of ordered DAG languages
- Graph automata for linear graph languages
- Complexity of boundary graph languages
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- On structured graph grammars. I
- Edge-label controlled graph grammars
- Title not available (Why is that?)
- Node replacements in embedding normal form.
- Automatic graphs and D0L-sequences of finite graphs
- Node replacement graph grammars with dynamic node relabeling
- Title not available (Why is that?)
- Metatheorems for decision problems on hyperedge replacement graph languages
- Title not available (Why is that?)
- On the structure of recognizable languages of dependence graphs
- The bounded degree problem for NLC grammars is decidable
- The complexity of graph languages generated by hyperedge replacement
- Monadic second-order definable graph transductions: a survey
- On the structure of linear apex NLC graph grammars
- Separation results for separated apex NLC and NCE graph languages
- Nonterminal separation in graph grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Boundary graph grammars with dynamic edge relabeling
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Title not available (Why is that?)
- Power properties of NLC graph grammars with a polynomial membership problem
- Hypergraph languages of bounded degree
- Handle-rewriting hypergraph grammars
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Separating \(k\)-separated eNCE graph languages
- Logical description of context-free graph languages
- A hierarchy of eNCE families of graph languages
- Title not available (Why is that?)
- 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
- Algorithms for graph problems on BNLC structured garphs
- Linear graph grammars: Power and complexity
- Undecidability of the bandwidth problem on linear graph languages
- The complexity of regular DNLC graph languages
- Order independent NCE grammars recognized in polynomial time
- Restrictions on NLC graph grammars
- On the membership problem for regular DNLC grammars
- Handle NLC grammars and r. e. languages
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Nonterminal bounded NLC graph grammars
- Title not available (Why is that?)
- On hyperedge replacement and BNLC graph grammars
- Quasi-rocking real-time pushdown automata
- Title not available (Why is that?)
- Finite graph automata for linear and boundary graph languages
- The bounded degree problem for eNCE graph grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Neighborhood-uniform NLC grammars
- Graph theoretic closure properties of the family of boundary NLC graph languages
- Combinatorial properties of boundary NLC graph languages
- Double Greibach operator grammars
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)
