Abstract:
Two-state automata of intermediate growth over a two-letter alphabet are studied. The asymptotic behavior of the growth function is analyzed. A system of defining relations is found. It is proved that such a system cannot be finite.
Citation:
I. I. Reznikov, V. I. Sushchanskii, “Two-State Mealy Automata of Intermediate Growth over a Two-Letter Alphabet”, Mat. Zametki, 72:1 (2002), 102–117; Math. Notes, 72:1 (2002), 90–104