Subword complexity and power avoidance
From MaRDI portal
Publication:2326389
DOI10.1016/j.tcs.2018.09.010zbMath1447.68014arXiv1801.05376OpenAlexW2784198544MaRDI QIDQ2326389
Jeffrey O. Shallit, Arseny M. Shur
Publication date: 7 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.05376
Related Items (11)
Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters ⋮ Weighted prefix normal words: mind the gap ⋮ On minimal critical exponent of balanced sequences ⋮ Avoiding square-free words on free groups ⋮ Properties of a ternary infinite word ⋮ Automatic sequences in negative bases and proofs of some conjectures of shevelev ⋮ Construction of a bi-infinite power free word with a given factor and a non-recurrent letter ⋮ On balanced sequences and their asymptotic critical exponent ⋮ Transition property for cube-free words ⋮ Abelian repetition threshold revisited ⋮ Upper bound for palindromic and factor complexity of rich words
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding context equivalence of binary overlap-free words in linear time
- Growth properties of power-free languages
- Last cases of Dejean's conjecture
- Polynomial versus exponential growth in repetition-free binary words
- On ternary square-free circular words
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- On critical exponents in fixed points of non-erasing morphisms
- Repetition-free words
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Enumeration of irreducible binary words
- Complexity and special factors
- Complexity of sequences and dynamical systems
- Special factors, periodicity, and an application to Sturmian words
- Enumeration of factors in the Thue-Morse word
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- Avoiding letter patterns in ternary square-free words
- The structure of the set of cube-free $ Z$-words in a two-letter alphabet
- Fife's Theorem for (7/3)-Powers
- Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words
- Ternary Square-Free Partial Words with Many Wildcards
- Constructing Premaximal Ternary Square-Free Words of Any Level
- On Two Stronger Versions of Dejean’s Conjecture
- A proof of Dejean’s conjecture
- A generator of morphisms for infinite words
- Comparing Complexity Functions of a Language and Its Extendable Part
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Automatic Sequences
- On the growth rates of complexity of threshold languages
- Fife’s Theorem Revisited
- Repetitions in words
- Cubefree words with many squares
- On combinatorial properties of the Arshon sequence
This page was built for publication: Subword complexity and power avoidance
