Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
From MaRDI portal
Publication:5041268
DOI10.1007/978-3-030-48516-0_22OpenAlexW2999391349MaRDI QIDQ5041268
Publication date: 13 October 2022
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.02184
Related Items (3)
Avoiding square-free words on free groups ⋮ Construction of a bi-infinite power free word with a given factor and a non-recurrent letter ⋮ Upper bound for palindromic and factor complexity of rich words
Cites Work
- Last cases of Dejean's conjecture
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Subword complexity and power avoidance
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Growth Properties of Power-Free Languages
- Transition property for cube-free words
- Unnamed Item
This page was built for publication: Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
