English

Matrix Graph Grammars

Discrete Mathematics 2009-11-17 v2

Abstract

This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely algebraic approach does not exist up to now. A Chomsky (or string) grammar is, roughly speaking, a precise description of a formal language (which in essence is a set of strings). On a more discrete mathematical style, it can be said that graph grammars -- Matrix Graph Grammars in particular -- study dynamics of graphs. Ideally, this algebraization would enforce our understanding of grammars in general, providing new analysis techniques and generalizations of concepts, problems and results known so far.

Keywords

Cite

@article{arxiv.0801.1245,
  title  = {Matrix Graph Grammars},
  author = {Pedro Pablo Perez Velasco},
  journal= {arXiv preprint arXiv:0801.1245},
  year   = {2009}
}

Comments

321 pages, 75 figures. This book has is publisehd by VDM verlag, ISBN 978-3639212556

R2 v1 2026-06-21T10:00:48.371Z