RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics // Archive

Izv. Saratov Univ. Math. Mech. Inform., 2013 Volume 13, Issue 2(2), Pages 58–66 (Mi isu414)

This article is cited in 1 paper

Computer science

Automata on algebraic structures

V. V. Skobelev

Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Ukraine, 83114, Donetsk, R. Luxemburg st., 74

Abstract: A survey of results obtained in investigations of automata determined over finite algebraic structures. The objects of research are automata over some finite ring, automata determined in terms of ideals, automata over varieties, and families of hash-functions determined by automata without output function. Computational security, complexity of simulation and homomorphisms of investigated automata are characterized.

Key words: rings, automata, identification, computational security.

UDC: 512.7+519.7+681.3

DOI: 10.18500/1816-9791-2013-13-2-2-58-66



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026