18 citations · 28 across the 7 of their papers we have counts for
7 papers
Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
Frank Drewes, Berthold Hoffmann, Mark Minas
Graph-based modeling plays a fundamental role in many areas of computer science. In this paper, we introduce systems of graph formulas with variables for specifying graph propertie…
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…
Speeding up Generalized PSR Parsers by Memoization Techniques
Mark Minas
Predictive shift-reduce (PSR) parsing for hyperedge replacement (HR) grammars is very efficient, but restricted to a subclass of unambiguous HR grammars. To overcome this restricti…
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…