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.

References in corpus (2)

• The concept of duality for automata over a changing alphabet and generation of a free group by such automata
• The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata

Cited by in corpus (1)

• On groups generated by bi-reversible automata: the two-state case over a changing alphabet