%0 Journal Article
%A Skobelev, V.V.
%D 2012
%I Begell House
%K automata, parametric identification, finite commutative associative ring with unity, asymptotically exact simulation models.
%N 5
%P 57-66
%R 10.1615/JAutomatInfScien.v44.i5.60
%T Simulation of Automata over a Finite Ring by the Automata with a Finite Memory
%U http://dl.begellhouse.com/journals/2b6239406278e43e,77eca4ec4b58fce7,4eadade57629f95b.html
%V 44
%X An approach to solving the problem of parametric identification of the automaton, determined by the system of equations with parameters over a finite commutative associative ring with unit, based on the use of automata with a finite memory, is studied. The accuracy of identification on the suffixes of input words, obtained by dropping the prefixes of a fixed length, is characterized. The class of asymptotically exact simulation models is picked out and characterized.
%8 2012-07-12