On the context-freeness of the set of words containing overlaps
Abstract
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.
- Publication:
-
arXiv Mathematics e-prints
- Pub Date:
- October 2006
- DOI:
- arXiv:
- arXiv:math/0610067
- Bibcode:
- 2006math.....10067R
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Formal Languages and Automata Theory;
- 68R15
- E-Print:
- 8 pages