Square-free words on partially commutative free monoids
Information Processing Letters
Enumeration of irreducible binary words
Discrete Applied Mathematics
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
On the number of partially abelian square-free words on a three-letter alphabet
Theoretical Computer Science
Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters
Theoretical Computer Science
Overlap-free words and finite automata
Theoretical Computer Science
On the number of Abelian square-free words on four letters
Discrete Applied Mathematics
A unified approach to word occurrence probabilities
Discrete Applied Mathematics - Special volume on combinatorial molecular biology
Theory of Codes
Theoretical Computer Science
Overlap-free words on two symbols
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Abelian Squares are Avoidable on 4 Letters
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Counting Overlap-Free Binary Words
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Circular words avoiding patterns
DLT'02 Proceedings of the 6th international conference on Developments in language theory
The entropy of square-free words
Mathematical and Computer Modelling: An International Journal
Existence of finite test-sets for k-power-freeness of uniform morphisms
Discrete Applied Mathematics
Overlap-free words and spectra of matrices
Theoretical Computer Science
Computing the growth of the number of overlap-free words with spectra of matrices
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Growth properties of power-free languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
Theoretical Computer Science
Growth of power-free languages over large alphabets
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Square-free words obtained from prefixes by permutations
Theoretical Computer Science
Growth of Power-Free Languages over Large Alphabets
Theory of Computing Systems
| Hi-index | 0.00 |
This survey reviews recent results on repetitions in words, with emphasis on the estimations for the number of repetition-free words.