In the Downloads section there is material covering Matrix Graph Grammar theory including its setup and its application to problems such as applicability, sequential independence and reachability.

For future research my intention is to continue with three further interesting problems: termination, confluence and complexity. I am currently dedicated to these tasks, more focused on complexity theory and the study of Matrix Graph Grammars as a model of computation.

A first step in this direction has succesfully established a link between Matrix Graph Grammars and Complex Analysis through so called Monotone Complex Logics. The paper can be found here.

If your interests are focused on discrete mathematics/theoretical computer science, there is still a huge research field on Matrix Graph Grammars. Please see Contribute! or contact me (all contact information is available here).

Also, I would like to improve this web site, for example by adding a wiki section with the latest topics of research (in which you can directly typeset your own ideas and results). Any help would be appreciated.