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

Abstract

For every natural number $n$, we classify abelian groups generated by an $n$-state time-varying automaton over the binary alphabet, as well as by an $n$-state Mealy automaton over the binary alphabet