Graph automata

  title={Graph automata},
  author={Symeon Bozapalidis and Antonios Kalampakas},
  journal={Theor. Comput. Sci.},
Magmoids satisfying the 15 fundamental equations of graphs, namely graphoids, are introduced. Automata on directed hypergraphs are defined by virtue of a relational graphoid. The closure properties of the so-obtained class are investigated, and a comparison is being made with the class of syntactically recognizable graph languages. c © 2007 Elsevier B.V. All rights reserved. 

From This Paper

Topics from this paper.
7 Citations
22 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 22 references

A variety theorem for trees and theories

  • Z. Esik
  • Publ. Math. 54
  • 1999
1 Excerpt


  • H. Ehrig, G. Engels, H.-J. Kreowski
  • Rozenberg (Eds.), Handbook of Graph Grammars and…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…