On structure and representations of cyclic automata
From MaRDI portal
Publication:897902
Recommendations
Cites work
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 3248552 (Why is no real title available?)
- scientific article; zbMATH DE number 3360085 (Why is no real title available?)
- scientific article; zbMATH DE number 3390671 (Why is no real title available?)
- 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
- Monoid-matrix type automata
- On the Automorphism Group of an Automaton
- On the endomorphisms of finite automata
- On the group of automorphisms of strongly connected automata
- Operation-preserving functions and autonomous factors of finite automata
- Representations of commutative asynchronous automata
- Some results on the relation between automata and their automorphism groups
- 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
(4)
This page was built for publication: On structure and representations of cyclic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897902)