Graph explorer

Graph Field Automata

The Graph Automata have been the paradigm in the expression of utilizing Graphs as a language. Matrix Graph grammars \cite{Pedro} 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.

4 nodes3 linksoverview mapGraph Field Automata
4 nodes3 links
Graph Field Automata4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWGraph Field Automatapreprint / 2015AJoshua HermanResearcherAKeith David PedersenResearcherTComputational Complexity1354 works
PaperSignal 103 links

Graph Field Automata

preprint / 2015

Open