Structural Theory of Automata, Semigroups, and Universal Algebra

Abstract

The paper gives the main results on the problems of expressibility and completeness for the automata functional systems. These results were obtained over the past 30 years, that is, since the appearance and during the years of formation of automata theory. The description of the properties of the automata functional systems is done for model systems in order of their increasing complexity. The first to be considered are automata without memory, i.e., the functions of κ-valued logic; then we consider automata with limited memory, i.e., the above-mentioned functions with delays, and finally, finite automata, i.e., automata functions.