Matrix Graph Grammars as a Model of Computation
Discrete Mathematics
2009-11-16 v3 Computational Complexity
Formal Languages and Automata Theory
Abstract
Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of tackling complexity theory through MGG. We also study its relation with other well-known models such as Turing machines (TM) and Boolean circuits (BC) as well as non-determinism. As a side effect, all techniques available for MGG can be applied to TMs and BCs.
Cite
@article{arxiv.0905.1202,
title = {Matrix Graph Grammars as a Model of Computation},
author = {Pedro Pablo Perez Velasco},
journal= {arXiv preprint arXiv:0905.1202},
year = {2009}
}
Comments
33 pages, 19 figures. English improved. One new section introducing an algebra of matrices