Graph Automata: The Algebraic Properties of Abelian Relational Graphoids

DOI10.1007/978-3-642-24897-9_8zbMath1350.68193OpenAlexW584704MaRDI QIDQ3098038

Antonios Kalampakas

Publication date: 11 November 2011

Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic theory of languages and automata (68Q70)

Related Items (1)

Syntactic recognizability of graphs with fuzzy attributes

Cites Work

• Unnamed Item
• Unnamed Item
• An axiomatization of graphs
• Context-free graph grammars and concatenation of graphs
• A Kleene theorem for a class of planar acyclic graphs
• Graph automata
• Parallel and two-way automata on directed ordered acyclic graphs
• Transductions of dags and trees
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach

This page was built for publication: Graph Automata: The Algebraic Properties of Abelian Relational Graphoids