Adaptive Star Grammars for Graph Models

DOI10.1007/978-3-540-87405-8_30zbMath1175.68219OpenAlexW1952073318MaRDI QIDQ3540417

Berthold Hoffmann, Mark Minas, Frank Drewes

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_30

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Graph grammars according to the type of input and manipulated data: a survey ⋮ Adaptive star grammars and their languages

Cites Work

• Unnamed Item
• Unnamed Item
• Concepts and realization of a diagram editor generator based on hypergraph transformation
• Adaptive star grammars and their languages
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Fundamentals of algebraic graph transformation
• Adaptive Star Grammars
• Handbook of Graph Grammars and Computing by Graph Transformation
• Semantics of context-free languages
• Relational and Kleene-Algebraic Methods in Computer Science

This page was built for publication: Adaptive Star Grammars for Graph Models