The Structure of an Automaton and Its Operation-Preserving Transformation Group
Journal of the ACM (JACM)
Isomorphism Groups of Automata
Journal of the ACM (JACM)
On the Structures of an Automaton and Its Input Semigroup
Journal of the ACM (JACM)
The Automorphism Group of the Direct Product of Strongly Related Automata
Journal of the ACM (JACM)
Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata
Journal of the ACM (JACM)
On the Automorphism Group of an Automaton
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Connectivity and Reversibility in Automata
Journal of the ACM (JACM)
On the number of automorphisms of a singly generated automaton
Communications of the ACM
Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism
IEEE Transactions on Computers
On a decomposition of fuzzy automata
Fuzzy Sets and Systems
Operation-preserving functions and autonomous factors of finite automata
Journal of Computer and System Sciences
On the structure of abelian automata
Journal of Computer and System Sciences
A characterization of automata and a direct product decomposition
Journal of Computer and System Sciences
Representations of commutative asynchronous automata
Journal of Computer and System Sciences
Hi-index | 0.02 |
Arbitrary finite automata are decomposed into their major substructures, the primaries. Several characterizations of homomorphisms, endomorphisms, isomorphisms, and automorphisms of arbitrary finite automata are presented via reduction to the primaries of the automata. Various characterizations of these transition-preserving functions on singly generated automata are presented and are used as a basis for the reduction. Estimates on the number of functions of each type are given.