Consider formal language $L$ in which each word has non-trivial period (non empty prefix that is also a suffix) over finite alphabet. Is $L$ context free?
I think that $L$ can be non context free. I want to use pumping lemma for context free languages but I can't find a word that I can pump.