$A$-completeness of systems with additives of linear automata over the ring of dyadic rationals

A brief description of results of $A$-completeness problem for linear finite state automata, functioning over the ring of dyadic rationals is given. Conditions of $A$-completeness for systems, containing all one-valued linear automata with finite additive and finite systems with a summing automaton are stated.