An infinite square-free co-CFL
Information Processing Letters
Multidimensional unrepetitive configurations (note)
Theoretical Computer Science
Enumeration of irreducible binary words
Discrete Applied Mathematics
Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
Theoretical Computer Science
Growth problems for avoidable words
Theoretical 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
Cantor sets and Dejean's conjecture
Journal of Automata, Languages and Combinatorics - Special issue: Second international conference developments in language theory
On the number of Abelian square-free words on four letters
Discrete Applied Mathematics
On Abelian squares and substitutions
Theoretical Computer Science
On repetition-free binary words of minimal density
Theoretical Computer Science
Words strongly avoiding fractional powers
European Journal of Combinatorics
Words avoiding Abelian inclusions
Journal of Automata, Languages and Combinatorics
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
Minimal Letter Frequency in n-th Power-Free Binary Words
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Nonrepetitive colorings of graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
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
Every real number greater than 1 is a critical exponent
Theoretical Computer Science
Exponential lower bounds for the number of words of uniform length avoiding a pattern
Information and Computation
The complexity of nonrepetitive coloring
Discrete Applied Mathematics
A cyclic binary morphism avoiding Abelian fourth powers
Theoretical Computer Science
Pattern avoidance by palindromes
Theoretical Computer Science
Unary pattern avoidance in partial words dense with holes
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Discrete Applied Mathematics
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Characterisations and examples of graph classes with bounded expansion
European Journal of Combinatorics
The avoidability of cubes under permutations
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Abelian pattern avoidance in partial words
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Repetition-freeness with Cyclic Relations and Chain Relations
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
| Hi-index | 0.00 |
We review results concerning words avoiding powers, abelian powers or patterns. In addition we collect/pose a large number of open problems.