Two-state Mealy automata of intermediate growth over a two-letter alphabet
From MaRDI portal
Publication:1810168
DOI10.1023/A:1019873206272zbMath1027.20048OpenAlexW1586435808MaRDI QIDQ1810168
I. I. Reznikov, V. I. Sushchans'kyi
Publication date: 15 June 2003
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019873206272
Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
The smallest Mealy automaton of intermediate growth. ⋮ A software system for growth analysis of Mealy automata ⋮ On the 3-state Mealy automata over an \(m\)-symbol alphabet of growth order \([n^{\log n/2\log m}\).]
