On the context-freeness of the set of words containing overlaps
Combinatorics
2009-03-29 v1 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.math/0610067,
title = {On the context-freeness of the set of words containing overlaps},
author = {Narad Rampersad},
journal= {arXiv preprint arXiv:math/0610067},
year = {2009}
}
Comments
8 pages