A-completeness recognition for finite systems with additives of linear automata over the ring of dyadic rationals

This work concerns questions of A-completeness of finite systems of linear automata over the ring of dyadic rationals. Condition of completeness of linear automata system, which includes automaton that models addition in the first step is described. For the formulated set of maximum subclasses in the class of linear automata over the ring of dyadic rationals decidability of a problem of finite set inclusion into these classes is proven.