Two-State Mealy Automata of Intermediate Growth over a Two-Letter Alphabet
Matematičeskie zametki, Tome 72 (2002) no. 1, pp. 102-117
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{MZM_2002_72_1_a9,
author = {I. I. Reznikov and V. I. Sushchanskii},
title = {Two-State {Mealy} {Automata} of {Intermediate} {Growth} over a {Two-Letter} {Alphabet}},
journal = {Matemati\v{c}eskie zametki},
pages = {102--117},
publisher = {mathdoc},
volume = {72},
number = {1},
year = {2002},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2002_72_1_a9/}
}
TY - JOUR AU - I. I. Reznikov AU - V. I. Sushchanskii TI - Two-State Mealy Automata of Intermediate Growth over a Two-Letter Alphabet JO - Matematičeskie zametki PY - 2002 SP - 102 EP - 117 VL - 72 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/MZM_2002_72_1_a9/ LA - ru ID - MZM_2002_72_1_a9 ER -
I. I. Reznikov; V. I. Sushchanskii. Two-State Mealy Automata of Intermediate Growth over a Two-Letter Alphabet. Matematičeskie zametki, Tome 72 (2002) no. 1, pp. 102-117. http://geodesic.mathdoc.fr/item/MZM_2002_72_1_a9/