7 papers
Parallel Hyperedge Replacement String Languages
Graham Campbell
There are many open questions surrounding the characterisation of groups with context-sensitive word problem. Only in 2018 was it shown that all finitely generated virtually Abelia…
Parallel Hyperedge Replacement Grammars
Graham Campbell
In 2018, it was shown that all finitely generated virtually Abelian groups have multiple context-free word problems, and it is still an open problem as to where to precisely place…
Fast Rule-Based Graph Programs
Graham Campbell, Brian Courtehoute, Detlef Plump
Implementing graph algorithms efficiently in a rule-based language is challenging because graph pattern matching is expensive. In this paper, we present a number of linear-time imp…
The Improved GP 2 Compiler
Graham Campbell, Jack Romo, Detlef Plump
GP 2 is a rule-based programming language based on graph transformation rules which aims to facilitate program analysis and verification. Writing efficient programs in such a langu…
Improving the GP 2 Compiler
Graham Campbell, Jack Romo, Detlef Plump
GP 2 is an experimental programming language based on graph transformation rules which aims to facilitate program analysis and verification. Writing efficient programs in such a la…
Efficient Recognition of Graph Languages
Graham Campbell, Detlef Plump
Graph transformation is the rule-based modification of graphs, and is a discipline dating back to the 1970s. In general, to match the left-hand graph of a fixed rule within a host…