Graph grammars according to the type of input and manipulated data: a survey
type: Item
instance of: scholarly article
title: Graph grammars according to the type of input and manipulated data: a survey
zbMATH Open document ID: 1387.68140
author: Saadia Albane
author: Hachem Slimani
author: H. Kheddouci
published in: Computer Science Review
publication date: 2018-05-18T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68P01
Mathematics Subject Classification ID: 68-02
zbMATH DE Number: 6870327
zbMATH Keywords: graph grammar
zbMATH Keywords: type of input and manipulated data
zbMATH Keywords: type of generated graph
zbMATH Keywords: big data
zbMATH Keywords: cloud computing
MaRDI profile type: Publication
full work available at URL: j.cosrev.2018.04.001
OpenAlex ID: W2797502603
cites work: Adaptive Star Grammars for Graph Models
cites work: Q4890712
cites work: Graph grammars with string-regulated rewriting
cites work: Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
cites work: Probabilistic Timed Graph Transformation Systems
cites work: Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation
cites work: Granularity of Conflicts and Dependencies in Graph Transformation Systems
cites work: Q3049830
cites work: Q3316615
cites work: Hyperedge replacement: grammars and languages
cites work: Pair grammars, graph languages and string-to-graph translations
cites work: Graph transformation for specification and programming
cites work: On the structure of node-label-controlled graph languages
cites work: Restrictions, extensions, and variations of NLC grammars
cites work: Decision problems for node label controlled graph grammars
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Separable graphs, planar graphs and web grammars
cites work: Web grammars and several graphs
cites work: Graph Grammars for Querying Graph-like Data
cites work: Q3673151
cites work: Linear and Context-Free Graph Grammars
cites work: Context-free graph grammars
cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars
cites work: On sequential and parallel node-rewriting graph grammars
cites work: A characterization of context-free string languages by directed node- label controlled graph grammars
cites work: Apex graph grammars and attribute grammars
cites work: On the inference of non-confluent NLC graph grammars
cites work: Linear graph grammars: Power and complexity
cites work: Graph grammars with neighbourhood-controlled embedding
cites work: Boundary graph grammars with dynamic edge relabeling
cites work: Node replacement graph grammars with dynamic node relabeling
cites work: Q5674993
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Graph grammars with path-controlled embedding
cites work: Q4036777
cites work: A comparison of boundary graph grammars and context-free hypergraph grammars
cites work: Handle-rewriting hypergraph grammars
cites work: Tree adjunct grammars
cites work: Adaptive star grammars and their languages
cites work: Plex languages
cites work: Context-free graph languages of bounded degree are generated by apex graph grammars
cites work: Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
cites work: Fusion Grammars: A Novel Approach to the Generation of Graph Languages
cites work: Q3751030
Wikidata QID: Q129980520
DOI: 10.1016/J.COSREV.2018.04.001
description: scientific article; zbMATH DE number 6870327