The automaton permutation group $AS_n$ generated by elements of infinite order

For an arbitrary integer $n\ge2$ we consider the group $AS_n$, constituted by boundedly determinate functions of one variable defined by means of initial automata with finite number of states on the Moore diagram, with input and output alphabets $E_n=\{0,1,\dots,n-1\}$, which at each state $q$ realize the output function $\psi(q,x)$ equal to some permutation $f_q(x)$ on the set $E_n$; $f_q(x)$ is an element of the complete symmetric group $S_n$. For $AS_n$ we give explicit generating system of elements of infinite order.