Graph Field Automata
Herman, Joshua · Pedersen, Keith David
Original · EN
The Graph Automata have been the paradigm in the expression of utilizing Graphs as a language. Matrix Graph grammars 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.