Node replacement graph grammars with dynamic node relabeling

DOI10.1016/J.TCS.2015.03.040zbMath1309.68109OpenAlexW2031713221MaRDI QIDQ2342679

Changwook Kim, Mahiro Ando

Publication date: 29 April 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.040

zbMATH Keywords

formal languagesgraph grammarsnode replacement systemdynamic node relabeling

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Graph grammars according to the type of input and manipulated data: a survey

Cites Work

• Unnamed Item
• Nonterminal separation in graph grammars
• Boundary graph grammars with dynamic edge relabeling
• Edge-label controlled graph grammars
• Handle NLC grammars and r. e. languages
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• Graph grammars with neighbourhood-controlled embedding
• Separating \(k\)-separated eNCE graph languages
• A hierarchy of eNCE families of graph languages
• Linear graph grammars: Power and complexity
• HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
• Handle-rewriting hypergraph grammars
• On sequential and parallel node-rewriting graph grammars
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Handbook of Graph Grammars and Computing by Graph Transformation
• Separation results for separated apex NLC and NCE graph languages

This page was built for publication: Node replacement graph grammars with dynamic node relabeling