On the complexity of analysis of automata over a finite ring

By Skobelev V.   Skobelev V.  

Cybernetics and Systems Analysis, Vol. 46, Iss. 4, 2010-07 ,pp. : 533-545

Springer Publishing Company

Access to resources Recommend Favorite

Some subsets of automata over a finite ring

By Skobelev V.  

Cybernetics and Systems Analysis, Vol. 47, Iss. 2, 2011-03 ,pp. : 198-201

Springer Publishing Company

Access to resources Recommend Favorite

Analysis of families of hash functions defined by automata over a finite ring

By Skobelev V.  

Cybernetics and Systems Analysis, Vol. 49, Iss. 2, 2013-03 ,pp. : 209-216

Springer Publishing Company

Access to resources Recommend Favorite

On group automata over finite fields

By Kelarev A.V.  

Finite Fields and Their Applications, Vol. 10, Iss. 1, 2004-01 ,pp. : 65-71

Elsevier

Access to resources Recommend Favorite

Solving the problem of invariance of probabilistic characteristics for a priori solvable systems of random nonlinear equations over a finite commutative ring with unity

By Levitskaja A.  

Cybernetics and Systems Analysis, Vol. 46, Iss. 3, 2010-05 ,pp. : 363-375

Springer Publishing Company

Access to resources Recommend Favorite