On the 3-state Mealy automata over an m-symbol alphabet of growth order [n^ n/2 m].
DOI10.1016/J.JALGEBRA.2006.03.039zbMATH Open1115.20045arXivmath/0603015OpenAlexW2033500455MaRDI QIDQ855332FDOQ855332
Authors: N. E. Zubov
Publication date: 7 December 2006
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0603015
Recommendations
Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- On Mahler's partition problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The smallest Mealy automaton of intermediate growth.
- Automata, dynamical systems, and groups
- On a Special Functional Equation
- Title not available (Why is that?)
- ON SOME SEMIGROUPS OF INTERMEDIATE GROWTH
- Title not available (Why is that?)
- Sequential Functions
- Relatively free semigroups of intermediate growth
- Problems of growth and rationality in algebra and topology
- Construction of p-groups of intermediate growth that have a continuum of quotient groups
- Composite and non-monotonic growth functions of Mealy automata.
- Two-state Mealy automata of intermediate growth over a two-letter alphabet
- Number Theory and Semigroups of Intermediate Growth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: On the 3-state Mealy automata over an \(m\)-symbol alphabet of growth order \([n^{\log n/2\log m}]\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855332)