Adaptive star grammars and their languages

DOI10.1016/j.tcs.2010.04.038zbMath1196.68110OpenAlexW2019001464MaRDI QIDQ986544

Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas

Publication date: 11 August 2010

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

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

zbMATH Keywords

graph grammargraph parsingcontext-free graph languagenode cloning

Mathematics Subject Classification ID

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

Related Items (8)

Preserving consistency in geometric modeling with graph transformations ⋮ AGREE – Algebraic Graph Rewriting with Controlled Embedding ⋮ Graph grammars with string-regulated rewriting ⋮ Adaptive Star Grammars for Graph Models ⋮ The PBPO graph transformation approach ⋮ Non-degenerate homogeneous \(\epsilon\)-Kähler and \(\epsilon\)-quaternion Kähler structures of linear type ⋮ Graph grammars according to the type of input and manipulated data: a survey ⋮ Algebraic graph rewriting with controlled embedding

Uses Software

• PROGRES

Cites Work

• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Applications of graph transformations with industrial relevance. Third international symposium, AGTIVE 2007, Kassel, Germany, October 10--12, 2007. Revised selected and invited papers
• Adaptive Star Grammars for Graph Models
• Adaptive Star Grammars
• Handbook of Graph Grammars and Computing by Graph Transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Algebraic automata and context-free sets

This page was built for publication: Adaptive star grammars and their languages