Via the context-free pumping lemma, you can even prove that prime numbers don't ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		Tainnor on June 21, 2023 \| parent \| context \| favorite \| on: A regular expression to check for prime numbers (2... Via the context-free pumping lemma, you can even prove that prime numbers don't form a context-free language either.

taejo on June 21, 2023 [–]

And via Parikh's theorem, with a one-symbol alphabet, regular and context-free languages are the same.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact