About finitely generated $A$ maximum-subclasses in the class of linear automata over dyadic rationals

This work concerns property of being finitely generated by operations of $A$-closing of found earlier maximum subclasses in the class of linear automata over the ring of dyadic rationals. We present the proof of the fact that two of them are not finitely generated, while others are finitely generated.