Growth of power-free languages over large alphabets
From MaRDI portal
Publication:1678750
DOI10.1007/s00224-013-9512-xzbMath1380.68259OpenAlexW2064854081MaRDI QIDQ1678750
Publication date: 7 November 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9512-x
Related Items (3)
The undirected repetition threshold and undirected pattern avoidance ⋮ Lower-bounds on the growth of power-free languages over large alphabets ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata and forbidden words
- Last cases of Dejean's conjecture
- Growth rates of complexity of power-free languages
- Uniformly growing k-th power-free homomorphisms
- On Dejean's conjecture over large alphabets
- Growth of repetition-free words -- a review
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Combinatorial Complexity of Regular Languages
- Comparing Complexity Functions of a Language and Its Extendable Part
- On the Existence of Minimal β-Powers
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Dejean's conjecture holds for N ≥ 27
- On the growth rates of complexity of threshold languages
- Symbolic Dynamics
This page was built for publication: Growth of power-free languages over large alphabets
