H. E. Pickett
Abstract
If an automaton is strongly connected, all of its automorphisms are regular permutations. It is proved that given any two groups G and H of regular permutations on finite sets A and B, respectively, there exists strongly connected automata @@@@ and @@@@ such that G and H are the automorphisms groups of @@@@ and @@@@, @@@@ × @@@@ is strongly connected and the automorphism group of @@@@ × @@@@ is G × H. Also it is proved that the reduced semigroup of an automaton is a regular group of permutations iff the automorphism group of @@@@ is regular and @@@@ is strongly connected. Using this result we construct examples where the automorphism groups have the above property for all strongly connected automata on A and B, and other examples where the automorphism group of @@@@ × @@@@ properly contains G × H.
- 1 ELGOT, C.C. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98 (1961), 21-51.Google Scholar
- 2 FLECK, A.C. Isomorphism groups of automata. J. ACM 9 (1962), 469-476. Google Scholar
- 3 MARICA. J. G., AND BRXA.NT, S .J . Unary algebras. Pacific J. Math. 10 (1960), 1347-1359.Google Scholar
- 4 WEEG, G .P . The automorphism group of the direct product of strongly relnted automata. J. ACM 12 (1965), 187-195. Google Scholar
- 5 WIELANDT, H. Finite Permutation Groups. Academic Press, New York, 1964Google Scholar
- 6 BIRKHOFF, G. Lattice Theory (Rev. Ed.). Amer. Muth. Soc. Colloq. Publications, 1948, p. 96, Exercise 4.Google Scholar
Index Terms
- Note Concerning the Algebraic Theory of Automata
Recommendations
The Algebraic Theory of Parikh Automata
The Parikh automaton model equips a finite automaton with integer registers and imposes a semilinear constraint on the set of their final settings. Here the theories of typed monoids and of rational series are used to characterize the language classes ...
Algebraic structures of automata
To determine the structure of an automaton A, we define the layers of A, which form a poset. We show that for any finite poset P there exists an automaton whose poset of layers is isomorphic to P. All subautomata of an automaton A are characterized by ...
Comments