Nonlinear automata over a finite ring

Authors:
V. G. Skobelev
Affiliations:
Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2006

Citing 2
Cited 4

Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Analyzing the structure of a class of linear automata over a ring $$ Z_{p^k } $$

Cybernetics and Systems Analysis
Analysis of a class of easily computable permutations

Cybernetics and Systems Analysis
Two types of nonlinear automata over a finite ring

Cybernetics and Systems Analysis
On the complexity of analysis of automata over a finite ring

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The properties of the class of information-lossless automata represented by recurrent relations over a finite ring are investigated. For these automata, the structure of classes of equivalent states is investigated, problems of parametric identification and identification of the initial state are solved, and the variation in the behavior of such automata as a result of variation of their parameters or initial states is characterized.