Repetition-free words
From MaRDI portal
The author derives general properties of the language of all words in an alphabet not satisfying a property P inherited by subwords. These include results on density and growing homomorphisms by which such words can be constructed. He derives as applications new proofs of results of the growth of squarefree words and new results on power 7/4 free words.
Recommendations
Cites work
- 2726. A problem on strings of beads
- A Characterization of the Morse Minimal Set
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Adherences of languages
- Avoidable patterns in strings of symbols
- Binary Sequences which Contain no BBb
- Embedding the dual of ^ in the lattice of equational classes of semigroups.
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3911732 (Why is no real title available?)
- scientific article; zbMATH DE number 3912631 (Why is no real title available?)
- scientific article; zbMATH DE number 3912632 (Why is no real title available?)
- scientific article; zbMATH DE number 3976386 (Why is no real title available?)
- scientific article; zbMATH DE number 3661611 (Why is no real title available?)
- scientific article; zbMATH DE number 3680097 (Why is no real title available?)
- scientific article; zbMATH DE number 3732062 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3893217 (Why is no real title available?)
- scientific article; zbMATH DE number 3894492 (Why is no real title available?)
- scientific article; zbMATH DE number 3246281 (Why is no real title available?)
- scientific article; zbMATH DE number 3326329 (Why is no real title available?)
- scientific article; zbMATH DE number 3375509 (Why is no real title available?)
- scientific article; zbMATH DE number 3379093 (Why is no real title available?)
- scientific article; zbMATH DE number 3193768 (Why is no real title available?)
- Infinite 0-1 sequences without long adjacent identical blocks
- New estimates of odd exponents of infinite Burnside groups.
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- On cube-free \(\omega\)-words generated by binary morphisms
- On the entropy of context-free languages
- On the subword complexity of square-free DOL languages
- Repetition of subwords in DOL languages
- Sharp characterizations of squarefree morphisms
- Some Combinatorial Properties of Free Semigroups
- Sur un théorème de Thue
- Uniformly growing k-th power-free homomorphisms
Cited in
(23)- Growth rates of power-free languages
- Enumeration of irreducible binary words
- Overlap-free morphisms and finite test-sets
- Non-repetitive words: Ages and essences
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
- Subword complexity and power avoidance
- RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
- Comparing Complexity Functions of a Language and Its Extendable Part
- Polynomial languages with finite antidictionaries
- On the Complexity of Deciding Avoidability of Sets of Partial Words
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- scientific article; zbMATH DE number 3932412 (Why is no real title available?)
- Growth properties of power-free languages
- Polynomial versus exponential growth in repetition-free binary words
- On the complexity of deciding avoidability of sets of partial words
- Interview with Jeffrey Shallit
- A note on the base-p expansions of putative counterexamples to the p-adic Littlewood conjecture
- Power-free complementary binary morphisms
- The first-order theory of binary overlap-free words is decidable
- On the entropy and letter frequencies of powerfree words
- Growth problems for avoidable words
- The entropy of square-free words
- Growth rates of complexity of power-free languages
This page was built for publication: Repetition-free words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078338)
