The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet (Q2629849)

For every positive integer \(n\), let \(\mathrm{TVA}(n)\) and \(\mathrm{MA}(n)\) stand for the class of all abelian groups that are generated by an \(n\)-state 2-letter time-varying automaton and respectively an \(n\)-state 2-letter Mealy automaton. The author gives a complete description of these classes. Namely, \(\mathrm{TVA}(1)\) consists of the trivial group and the group of order 2, and \(\mathrm{TVA}(n)\) with \(n>1\) is the class of all abelian groups of rank at most \(n\) whose torsion parts are 2-groups (Theorem~1). A group \(G\) is in \(\mathrm{MA}(n)\) if and only if \(G\) is either a free abelian group of rank at most \(n-1\) or an elementary abelian 2-group of rank at most \(n\) (Theorem~2).