On the complexity of analysis of automata over a finite ring

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

Citing 5
Cited 1

Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks

Cybernetics and Systems Analysis
Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics

Cybernetics and Systems Analysis
Nonlinear automata over a finite ring

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

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

Cybernetics and Systems Analysis

Some subsets of automata over a finite ring

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general scheme is investigated that is destined for obtaining estimates based on the cardinality of subsets of a fixed set of automata over some finite commutative-associative ring with unit element. A scheme is proposed to solve parametric systems of polynomial equations based on classes of associated elements of the ring. Some general characteristics of automata over the ring are established.