Article ID Journal Published Year Pages File Type
426972 Information and Computation 2016 10 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
Authors
,