Symmetries of automata

• Published in: Algebra and Discrete Mathematics
• Date: 2015
• Main Authors: Egri-Nagy, A., Nehaniv, C.L.
• Format: Article
• Language: English
• Published: Інститут прикладної математики і механіки НАН України 2015
• Online Access: https://nasplib.isofts.kiev.ua/handle/123456789/152786
• Journal Title: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Cite this: Symmetries of automata / A. Egri-Nagy, C.L. Nehaniv // Algebra and Discrete Mathematics. — 2015. — Vol. 19, № 1. — С. 48-57. — Бібліогр.: 7 назв. — англ.

For a given reachable automaton A, we prove that the (state-) endomorphism monoid End(A) divides its characteristic monoid M(A). Hence so does its (state-)automorphism group Aut(A), and, for finite A, Aut(A) is a homomorphic image of a subgroup of the characteristic monoid. It follows that in the presence of a (state-) automorphism group G of A, a finite automaton A (and its transformation monoid) always has a decomposition as a divisor of the wreath product of two transformation semigroups whose semigroups are divisors of M(A), namely the symmetry group G and the quotient of M(A) induced by the action of G. Moreover, this division is an embedding if M(A) is transitive on states of A. For more general automorphisms, which may be non-trivial on input letters, counterexamples show that they need not be induced by any corresponding characteristic monoid element.