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)
Structure and Transition-Preserving Functions of Finite Automata
Journal of the ACM (JACM)
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Automorphism groups and quotients of strongly connected automata and monadic algebras
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Finite automata and their decision problems
IBM Journal of Research and Development
A structure theory of automata characterized by groups
Journal of Computer and System Sciences
Hi-index | 0.00 |
The classes of automata characterized by certain semigroups are investigated: It isshown that the classes of cyclic quasi-state-independent automata, cyclic quasi-state-independent automat of monoid type, cyclic Abelian automata, strongly connected state-independent automata, strongly connected resect automata, quasi-perfect automata, and perfect automata are equivalent to the classes of automata generated by semigroups with left identity, monoids, commutative semigroups with identity, right groups, right zero semigroups, groups, and Abelian groups, respectively. The characterization of the endomorphism semigroups and the automorphism groups and the direct product decomposabilities for the above classes of automata are also given. Finally, it is shown that every regular set can be accepted by some cyclic quasi-state-independent acceptor of monoid type.