Graph automata

DOI10.1016/J.TCS.2007.11.022MaRDI QIDQ2481961zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
• Finite automata on directed graphs
• Recognition of graphs by automata
• scientific article; zbMATH DE number 3858446
• On congruences of automata defined by directed graphs

Cites work

• A Kleene theorem for a class of planar acyclic graphs
• A variety theorem for trees and theories
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• An axiomatization of graphs
• Automata in general algebras
• Context-free graph grammars and concatenation of graphs
• Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.)
• Handbook of Graph Grammars and Computing by Graph Transformation
• scientific article; zbMATH DE number 3692668 (Why is no real title available?)
• scientific article; zbMATH DE number 3607504 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3251427 (Why is no real title available?)
• scientific article; zbMATH DE number 3282607 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Iteration 2-theories
• Parallel and two-way automata on directed ordered acyclic graphs
• Recognizability of graph and pattern languages
• Transductions of dags and trees
• Transformational classes of grammars

Cited in

(19)

• Finite automata on directed graphs
• Recognition of graphs by automata
• Second-order finite automata
• Syntactic recognizability of graphs with fuzzy attributes
• Minimization of planar directed acyclic graph algebras
• Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
• Recognizable languages of arrows and cospans
• Graph automata for linear graph languages
• Interaction Graphs
• Second-Order Finite Automata
• scientific article; zbMATH DE number 7604432 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• Solving the Weighted HOM-Problem With the Help of Unambiguity
• The weighted HOM-problem over fields
• Weighted HOM-problem for nonnegative integers
• Finite automata for efficient graph recognition
• \textit{Grappa RE} -- a tool for efficient graph recognition based on finite automata and regular expressions
• Graph automata: Natural expression of self-reproduction
• An axiomatization of graphs

This page was built for publication: Graph automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481961)