On the complexity of analysis of automata over a finite ring
From MaRDI portal
Publication:2452751
DOI10.1007/s10559-010-9230-1zbMath1288.94083MaRDI QIDQ2452751
V. V. Skobelev, Volodymyr G. Skobelev
Publication date: 5 June 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-010-9230-1
Related Items
Some subsets of automata over a finite ring, Analysis of families of hash functions defined by automata over a finite ring, Statistically equivalent mappings of finite sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\)
- Two types of nonlinear automata over a finite ring
- Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks
- Nonlinear automata over a finite ring
- Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics
- Interval formulation of the diagnostic problem for bilinear automaton