Graph automata

Authors:
Symeon Bozapalidis;Antonios Kalampakas
Affiliations:
Aristotle University of Thessaloniki, Department of Mathematics, 54124, Thessaloniki, Greece;Aristotle University of Thessaloniki, Department of Mathematics, 54124, Thessaloniki, Greece
Venue:
Theoretical Computer Science
Year:
2008

Citing 5
Cited 3

A Kleene theorem for a class of planar acyclic graphs

Information and Computation
Context-free graph grammars

Handbook of formal languages, vol. 3
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution

Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
An Initial-Algebra Approach to Directed Acyclic Graphs

MPC '95 Mathematics of Program Construction
An axiomatization of graphs

Acta Informatica

Recognizable graph languages for the verification of dynamic systems

ICGT'10 Proceedings of the 5th international conference on Graph transformations
Graph automata: the algebraic properties of abelian relational graphoids

Algebraic Foundations in Computer Science
Towards probabilistic acceptors and transducers for feature structures

SSST-6 '12 Proceedings of the Sixth Workshop on Syntax, Semantics and Structure in Statistical Translation

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.