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

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

Citing 3
Cited 1

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
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

Basic finite-automaton characteristics are established for the class of all linear automata and information-lossless automata over a ring. The complexities of solving problems of parametric identification and initial-state identification are analyzed. The sets of fixed points for mappings realized by initial automata are characterized. Canonical forms are proposed for linear automata over the ring.