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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.