Boundary graph grammars with dynamic edge relabeling
TLDR
This work investigates this type of graph grammar and shows that the use of edge labels (together with the NCE feature) is responsible for some new properties, and proves that the class of (boundary) eNCE languages properly contains the closure of theclass of ( boundary) NLC languages under node relabelings.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1990-06-01 and is currently open access. It has received 49 citations till now. The article focuses on the topics: Context-sensitive grammar & Tree-adjoining grammar.read more
Citations
More filters
Journal ArticleDOI
Handle-rewriting hypergraph grammars
TL;DR: The handle-rewriting hypergraph grammars (HH Grammars) are introduced, based on the replacement of handles, i.e., of subhypergraphs consisting of one hyperedge together with its incident vertices, which can be characterized as the least solutions of certain systems of equations.
Book ChapterDOI
Context-free graph grammars
TL;DR: Graph languages are sets of labeled graphs that can be generated by graph grammars, and in particular by context-free graph gramMars, which can be used to generate string languages and tree languages.
Journal ArticleDOI
A comparison of boundary graph grammars and context-free hypergraph grammars
TL;DR: It is shown that the class of boundary graph languages is closed under the operation of edge contraction, where the label of the edge indicates whether or not the edge should be contracted.
Book ChapterDOI
Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars
TL;DR: An elementary introduction to the notion of an NLC graph grammar is given, and several of its extensions and variations are discussed in a systematic way.
Journal ArticleDOI
Linear graph grammars power and complexity
Joost Engelfriet,George Leih +1 more
TL;DR: These results are shown for graph Grammars with neighbourhood controlled embedding and with dynamic edge relabeling (eNCE grammars).
References
More filters
Book
Tree automata
TL;DR: A context-free grammar over the terminal alphabet generating the Dyck language of well-bracketed strings and a product construction for nondeterministic bu-ta A 1 and A 2, to discuss whether there are simpler means of specifying them formally.
Book
Graph Grammars and Their Application to Computer Science: 3rd International Workshop Warrenton, Virginia, Usa, December 2-6, 1986
TL;DR: A tutorial introduction to the algebraic approach of graph grammars can be found in this paper, where the authors introduce the Hyperedge replacement method and an introduction to parallel map generating systems.
Related Papers (5)
Boundary NLC graph grammars--basic definitions, normal forms, and complexity
Grzegorz Rozenberg,Emo Welzl +1 more