Automaton identification in the class of Sprott's automata

The problem of automaton identification in the class of Sprott's automata over the finite ring $\mathbf Z_p^k=(\mathbf Z_p^k,\oplus,\circ)$ is solved. The estimation problem of the solution complexity is considered as a necessary characteristics for computational security of a stream cipher determined by the Sprott's automaton when information stream is interpreted as some control. It is shown that in a Sprott's automata subclass the problem is solved by carrying out multiple experiments with automaton.