Matrix Graph Automata
2008
The Graph Automata have been the paradigm in the expression of utilizing
Graphs as a language. Matrix Graph grammars are a reformulation of other Graph
grammar approaches in a more However the power of Turing's machine is limited
by its foundation in binary numbers, as Turing himself pointed out when he
proposed the "Oracle," a vastly superior computer that would compute the answer
of operations in one single step, not multiple steps. The advantage to this
approach is a framework for expressing machines that can use Matrix Graph
Grammars.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI