18 citations · 24 across the 5 of their papers we have counts for
5 papers
Finite Automata for Efficient Graph Recognition
Frank Drewes, Berthold Hoffmann, Mark Minas
Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string l…
Proceedings Twelfth International Workshop on Graph Computational Models
Berthold Hoffmann, Mark Minas
This volume contains the post-proceedings of the Twelfth International Workshop on Graph Computation Models (GCM 2021). The workshop was part of STAF 2021 (Software Technologies: A…
Proceedings of the Eleventh International Workshop on Graph Computation Models
Berthold Hoffmann, Mark Minas
Graphs are common mathematical structures that are visual and intuitive. They constitute a natural and seamless way for system modelling in science, engineering and beyond, includi…
Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars based on Hyperedge Replacement
Frank Drewes, Berthold Hoffmann, Mark Minas
Hyperedge replacement (HR) grammars can generate NP-complete graph languages, which makes parsing hard even for fixed HR languages. Therefore, we study predictive shift-reduce (PSR…
Towards rule-based visual programming of generic visual systems
Berthold Hoffmann, Mark Minas
This paper illustrates how the diagram programming language DiaPlan can be used to program visual systems. DiaPlan is a visual rule-based language that is founded on the computatio…