TWO TYPES OF NONLINEAR AUTOMATA OVER A FINITE RING

摘要

The structure of a class of automata is analyzed. These automata are analogs of symmetric chaotic dynamical systems over a finite ring, namely, the Guckenheimer-Holmes cycle and free-running systems. Problems of parametric identification and identification of initial states are solved, and a set of fixed points of automaton mappings is characterized.