4 research outputs found
Finite groups as groups of automata with no cycles with exit
Representations of finite groups as automata groups over a binary alphabet are investigated. The subclass of groups of automata with no cycles with exit is studied
Conjugacy in finite state wreath powers of finite permutation groups
It is proved that conjugated periodic elements of the infinite wreath power of a finite permutation group are conjugated in the finite state wreath power of this group. Counter-examples for non-periodic elements are given
A characterization of those automata that structurally generate finite groups
Antonenko and Russyev independently have shown that any Mealy automaton with
no cycles with exit--that is, where every cycle in the underlying directed
graph is a sink component--generates a fi- nite (semi)group, regardless of the
choice of the production functions. Antonenko has proved that this constitutes
a characterization in the non-invertible case and asked for the invertible
case, which is proved in this paper
On the Finiteness Problem for Automaton (Semi)groups
This paper addresses a decision problem highlighted by Grigorchuk,
Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton
(semi)groups.
For semigroups, we give an effective sufficient but not necessary condition
for finiteness and, for groups, an effective necessary but not sufficient
condition. The efficiency of the new criteria is demonstrated by testing all
Mealy automata with small stateset and alphabet. Finally, for groups, we
provide a necessary and sufficient condition that does not directly lead to a
decision procedure