Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2031101
- On a Graph Calculus for Algebras of Relations
- scientific article; zbMATH DE number 517053
- Graph automata
- scientific article; zbMATH DE number 193710
- scientific article; zbMATH DE number 7604432
- scientific article; zbMATH DE number 177437
- Relation algebras and \(t\)-vertex condition graphs
- Graph automata for linear graph languages
- Abelian core of graph algebras
Cites work
- scientific article; zbMATH DE number 3692668 (Why is no real title available?)
- scientific article; zbMATH DE number 3607504 (Why is no real title available?)
- A Kleene theorem for a class of planar acyclic graphs
- Algebra automata I: Parallel programming as a prolegomena to the categorical approach
- An axiomatization of graphs
- Context-free graph grammars and concatenation of graphs
- Graph automata
- Parallel and two-way automata on directed ordered acyclic graphs
- Transductions of dags and trees
Cited in
(4)
This page was built for publication: Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098038)