Representations of commutative asynchronous automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53545 (Why is no real title available?)
- scientific article; zbMATH DE number 1455132 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 3225363 (Why is no real title available?)
- A note on the languages recognized by commutative asynchronous automata
- A representation of strongly connected automata and its applications
- A structure theory of automata characterized by groups
- Algebraic Theory of Automata and Languages
- Group-Type Automata
- Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata
- Isomorphism Groups of Automata
- On commutative asynchronous nondeterministic automata
- On the Automorphism Group of an Automaton
- On the group of automorphisms of strongly connected automata
- Structure and Transition-Preserving Functions of Finite Automata
- The Automorphism Group of the Direct Product of Strongly Related Automata
- The Structure of an Automaton and Its Operation-Preserving Transformation Group
- The cartesian composition of automata
Cited in
(8)- scientific article; zbMATH DE number 6109856 (Why is no real title available?)
- scientific article; zbMATH DE number 2111980 (Why is no real title available?)
- Monoid-matrix type automata
- Compositional synthesis of asynchronous automata
- scientific article; zbMATH DE number 64148 (Why is no real title available?)
- On structure and representations of cyclic automata
- A representation of cyclic commutative asynchronous automata
- Aligning the representation and reality of computation with asynchronous logic automata
This page was built for publication: Representations of commutative asynchronous automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414910)