Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Analytic models and ambiguity of context-free languages
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
Canonical positions for the factors in paperfolding sequences
Theoretical Computer Science
Subword complexity of a generalized Thue-Morse word
Information Processing Letters
Transcendence of formal power series with rational coefficients
Theoretical Computer Science
Semirings, Automata and Languages
Semirings, Automata and Languages
Overlap-free words on two symbols
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Counting Overlap-Free Binary Words
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Some Recent Results on Squarefree Words
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
The Subword Complexity of Fixed Points of Binary Uniform Morphisms
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
A Characterization of 2+-free Words over a Binary Alphabet
A Characterization of 2+-free Words over a Binary Alphabet
On the structure of the counting function of sparse context-free languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
| Hi-index | 0.89 |
We show that the set of binary words containing overlaps is not unambiguously context-free and that the set of ternary words containing overlaps is not context-free. We also show that the set of binary words that are not subwords of the Thue-Morse word is not unambiguously context-free.