Graph Field Automata

Details Graph Field Automata Graph Field Automata

2008-12-22

arxiv.org/abs/0812.4009v19

Computer Science

Computational Complexity

8 pages 1 figure v1 initial submission v2 Minor Changes v3 More minor changes v4 still more minor changes v5 Rewritten base as

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graph Field Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph Field Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Field Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-537480