Graph automata
From MaRDI portal
Recommendations
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?)
- 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?)
- 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
- 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
(16)- scientific article; zbMATH DE number 7604432 (Why is no real title available?)
- Graph automata for linear graph languages
- Graph automata: Natural expression of self-reproduction
- Syntactic recognizability of graphs with fuzzy attributes
- An axiomatization of graphs
- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
- Second-order finite automata
- Mathematical Foundations of Computer Science 2004
- Solving the Weighted HOM-Problem With the Help of Unambiguity
- Recognition of graphs by automata
- Minimization of planar directed acyclic graph algebras
- The weighted HOM-problem over fields
- Finite automata on directed graphs
- Second-Order Finite Automata
- Recognizable languages of arrows and cospans
- Interaction 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)