Reduced criterial system of are precomplete classes in linear automata classes over finite fields

A. A. Chasovskikh

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: The sets of all precomplete classes in the classes of linear automata over finite fields are found, which are reduced criteria systems in these classes.

Keywords: finite automaton, linear automaton, composition operations, superposition operations, feedback, completeness problem, precomplete class, criterial system, reduced criterial system, adder, delay.