Graph grammars according to the type of input and manipulated data: a survey
From MaRDI portal
Publication:1750316
DOI10.1016/j.cosrev.2018.04.001zbMath1387.68140OpenAlexW2797502603WikidataQ129980520 ScholiaQ129980520MaRDI QIDQ1750316
Saadia Albane, Hachem Slimani, Hamamache Kheddouci
Publication date: 18 May 2018
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2018.04.001
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42) General topics in the theory of data (68P01)
Cites Work
- Graph grammars with string-regulated rewriting
- Hyperedge replacement: grammars and languages
- Boundary graph grammars with dynamic edge relabeling
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Adaptive star grammars and their languages
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Apex graph grammars and attribute grammars
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- A characterization of context-free string languages by directed node- label controlled graph grammars
- Decision problems for node label controlled graph grammars
- Graph grammars with neighbourhood-controlled embedding
- Graph grammars with path-controlled embedding
- Tree adjunct grammars
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Graph transformation for specification and programming
- Linear graph grammars: Power and complexity
- Node replacement graph grammars with dynamic node relabeling
- Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
- Handle-rewriting hypergraph grammars
- Plex languages
- Pair grammars, graph languages and string-to-graph translations
- Web grammars and several graphs
- On the inference of non-confluent NLC graph grammars
- On sequential and parallel node-rewriting graph grammars
- Adaptive Star Grammars for Graph Models
- Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation
- Context-free graph grammars
- Graph Grammars for Querying Graph-like Data
- Handbook of Graph Grammars and Computing by Graph Transformation
- Fusion Grammars: A Novel Approach to the Generation of Graph Languages
- Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
- Granularity of Conflicts and Dependencies in Graph Transformation Systems
- Probabilistic Timed Graph Transformation Systems
- Separable graphs, planar graphs and web grammars
- Linear and Context-Free Graph Grammars
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graph grammars according to the type of input and manipulated data: a survey