2008/12/22 by Joshua Herman, Herman, Joshua, Keith David Pedersen +1
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Formal Methods in Verification #Logic, programming, and type systems #Model-Driven Software Engineering Techniques
paper · pdf · doi:10.48550/arxiv.0812.4009
openalex publication_date 2008/12/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Graph Automata have been the paradigm in the expression of utilizing Graphs as a language. Matrix Graph grammars \citePedro are an algebratization of graph rewriting systems. Here we present the dual of this formalizm which some extensions which we term Graph Field Automata The advantage to this approach is a framework for expressing machines that can use Matrix Graph Grammars.