337
Oh boy what a beautiful regex. I'm sure it does something logical and easy to understand.
(lemmy.world)
^.?$|^(..+?)\1+$
Matches strings of any character repeated a non-prime number of times
If the set of all strings of composite length is a regular language, you can use that to prove the set of all strings of prime length are also a regular language.
But it's also easy to prove that the set of language of strings of prime length is not regular, and thus the language of strings of composite length also can't be regular.
A more formal proof.
Thank you for this. I'll review this when I can.