Graph Field Automata
Computational Complexity
2015-12-08 v9
Abstract
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.
Keywords
Cite
@article{arxiv.0812.4009,
title = {Graph Field Automata},
author = {Joshua Herman and Keith David Pedersen},
journal= {arXiv preprint arXiv:0812.4009},
year = {2015}
}
Comments
totally wrong doesn't make any sense would like to widthdraw