Repetition-free words
From MaRDI portal
Publication:1078338
DOI10.1016/0304-3975(86)90116-7zbMath0596.20058OpenAlexW1992016479MaRDI QIDQ1078338
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90116-7
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (18)
RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES ⋮ Overlap-free morphisms and finite test-sets ⋮ On the entropy and letter frequencies of powerfree words ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ Enumeration of irreducible binary words ⋮ On the complexity of deciding avoidability of sets of partial words ⋮ Interview with Jeffrey Shallit ⋮ Growth problems for avoidable words ⋮ Comparing Complexity Functions of a Language and Its Extendable Part ⋮ Growth properties of power-free languages ⋮ The entropy of square-free words ⋮ On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) ⋮ Growth rates of complexity of power-free languages ⋮ 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 ⋮ Growth rates of power-free languages ⋮ Subword complexity and power avoidance
Cites Work
- New estimates of odd exponents of infinite Burnside groups.
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Infinite 0-1 sequences without long adjacent identical blocks
- Avoidable patterns in strings of symbols
- Adherences of languages
- On the subword complexity of square-free DOL languages
- Sharp characterizations of squarefree morphisms
- On cube-free \(\omega\)-words generated by binary morphisms
- Uniformly growing k-th power-free homomorphisms
- Embedding the dual of \(\Pi^\infty\) in the lattice of equational classes of semigroups.
- Sur un théorème de Thue
- 2726. A problem on strings of beads
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- Repetition of subwords in DOL languages
- Binary Sequences which Contain no BBb
- Some Combinatorial Properties of Free Semigroups
- A Characterization of the Morse Minimal Set
- On the entropy of context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Repetition-free words
