String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
DOI10.1016/0166-218X(87)90051-5zbMATH Open0619.68064OpenAlexW2041437718WikidataQ54309814 ScholiaQ54309814MaRDI QIDQ1089809FDOQ1089809
Authors: Klaus-Jörn Lange, Emo Welzl 
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(87)90051-5
Recommendations
- scientific article; zbMATH DE number 3917735
- Graph Transformations
- Nonterminal separation in graph grammars
- scientific article; zbMATH DE number 4106287
- scientific article; zbMATH DE number 3885330
- scientific article; zbMATH DE number 3872712
- Parsing and generation with static discontinuity grammars
- Graph grammars with string-regulated rewriting
- Structure graphs and structure graph grammars
- Disambiguating grammars by exclusion of sub-parse trees
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of node-label-controlled graph languages
- Title not available (Why is that?)
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Restrictions, extensions, and variations of NLC grammars
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
- Title not available (Why is that?)
- Pair grammars, graph languages and string-to-graph translations
- Title not available (Why is that?)
- Title not available (Why is that?)
- A class of linearly parsable graph grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Developmental systems with interaction and fragmentation
- JL systems with non-fragmented axioms: The hierarchy
- Context-free graph grammars
Cited In (13)
- String Generating Hypergraph Grammars with Word Order Restrictions
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
- The complexity of graph languages generated by hyperedge replacement
- On the structure of linear apex NLC graph grammars
- Recognising \(k\)-connected hypergraphs in cubic time
- Uniform parsing for hyperedge replacement grammars
- Graph parsing as graph transformation. Correctness of predictive top-down parsers
- A hierarchy of eNCE families of graph languages
- The complexity of regular DNLC graph languages
- Contextual hyperedge replacement
- Title not available (Why is that?)
- Graph Transformations
This page was built for publication: String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089809)
