TWO TYPES OF NONLINEAR AUTOMATA OVER A FINITE RING

被引：0

作者：

Skobelev, V. V. ^{[1
]}

机构：

[1] Natl Acad Sci Ukraine, Inst Appl Math & Mech, Donetsk, Ukraine

来源：

CYBERNETICS AND SYSTEMS ANALYSIS | 2009年 / 45卷 / 04期

关键词：

equivalent states; state identification; parametric identification; fixed point;

D O I：

10.1007/s10559-009-9123-3

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：551 / 561

页数：11