Growth of repetition-free words -- a review

DOI10.1016/J.TCS.2005.03.039zbMATH Open1078.68112OpenAlexW2038914003MaRDI QIDQ2484440FDOQ2484440

Authors: Jean Berstel 

Publication date: 1 August 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.039

zbMATH Keywords

Combinatorics on wordsSquare-free wordsOverlap-free wordsRepetitions in words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• A unified approach to word occurrence probabilities
• Motif statistics.
• Title not available (Why is that?)
• Automatic Sequences
• Title not available (Why is that?)
• Uniformly growing k-th power-free homomorphisms
• Title not available (Why is that?)
• Title not available (Why is that?)
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Abelian squares are avoidable on 4 letters
• The Goulden—Jackson cluster method: extensions, applications and implementations
• There exist binary circular \(5/2^+\) power free words of every length
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Title not available (Why is that?)
• Polynomial versus exponential growth in repetition-free binary words
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• Title not available (Why is that?)
• Improved bounds on the number of ternary square-free words
• NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
• Sequences generated by infinitely iterated morphisms
• Title not available (Why is that?)
• A linear-time algorithm to decide whether a binary word contains an overlap
• On the synchronizing properties of certain prefix codes
• Enumeration of irreducible binary words
• On the entropy and letter frequencies of ternary square-free words
• Title not available (Why is that?)
• On the number of Abelian square-free words on four letters
• ON ABELIAN POWER-FREE MORPHISMS
• Overlap-free words and finite automata
• Title not available (Why is that?)
• The entropy of square-free words
• The number of binary cube-free words of length up to 47 and their numerical analysis
• Partially abelian squarefree words
• Square-free words on partially commutative free monoids
• Title not available (Why is that?)
• Developments in Language Theory

Cited In (15)

• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• Binary words avoiding the pattern AABBCABBA
• Square-free words obtained from prefixes by permutations
• Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices
• On duplication-free codes for disjoint or equal-length errors
• Growth of power-free languages: numerical and asymptotic bounds
• Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
• Growth properties of power-free languages
• On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
• Volume formula and growth rates of the balls of strings under the edit distances
• Growth of power-free languages over large alphabets
• Exact computation of joint spectral characteristics of linear operators
• On the entropy and letter frequencies of powerfree words
• Overlap-free words and spectra of matrices
• Stability of Linear Problems: Joint Spectral Radius of Sets of Matrices

Uses Software

• OEIS
• JAN

This page was built for publication: Growth of repetition-free words -- a review

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484440)