A MEALY MACHINE WITH POLYNOMIAL GROWTH OF IRRATIONAL DEGREE

DOI10.1142/S0218196708004287zbMath1185.68430arXivmath/0506203OpenAlexW3103384428MaRDI QIDQ3502746

I. I. Reznykov, Laurent Bartholdi

Publication date: 20 May 2008

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0506203

zbMATH Keywords

growthautomataFibonacci numbersfinitely generated semigroupsrewriting systemself-similar semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

Functionally recursive rings of matrices -- two examples ⋮ Self-similar Lie algebras ⋮ GROWTH OF REES QUOTIENTS OF FREE INVERSE SEMIGROUPS DEFINED BY SMALL NUMBERS OF RELATORS

Cites Work

• Unnamed Item
• On the 3-state Mealy automata over an \(m\)-symbol alphabet of growth order \([n^{\log n/2\log m}\).]
• The Gelfand-Kirillov dimension of a tensor product
• The smallest Mealy automaton of intermediate growth.
• Construction of semigroups with some exotic properties.
• Subgroups and subrings of profinite rings
• LOWER BOUNDS ON THE GROWTH OF A GROUP ACTING ON THE BINARY ROOTED TREE
• ON SOME SEMIGROUPS OF INTERMEDIATE GROWTH
• Construction of Semigroups with Some Exotic Properties
• Relatively free semigroups of intermediate growth

This page was built for publication: A MEALY MACHINE WITH POLYNOMIAL GROWTH OF IRRATIONAL DEGREE