Graph automata

DOI10.1016/j.tcs.2007.11.022zbMath1136.68031OpenAlexW2912196347MaRDI QIDQ2481961

Symeon Bozapalidis, Antonios Kalampakas

Publication date: 15 April 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.022

zbMATH Keywords

automatadirected hypergraphsmagmoids

Mathematics Subject Classification ID

Hypergraphs (05C65) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Second-Order Finite Automata ⋮ Second-order finite automata ⋮ Recognizable languages of arrows and cospans ⋮ Solving the Weighted HOM-Problem With the Help of Unambiguity ⋮ Syntactic recognizability of graphs with fuzzy attributes ⋮ Graph Automata: The Algebraic Properties of Abelian Relational Graphoids ⋮ MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Recognizability of graph and pattern languages
• Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.)
• Parallel and two-way automata on directed ordered acyclic graphs
• Handbook of Graph Grammars and Computing by Graph Transformation
• Transductions of dags and trees
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• Automata in general algebras
• Transformational classes of grammars
• Iteration 2-theories

This page was built for publication: Graph automata