Prove that language L = {a^p ; p is prime} isn't regular using Myhill-Nerode theorem.

Prove that language L = {a^p ; p is prime} isn't regular using Myhill-Nerode theorem.

Answer

Answers can be viewed only if
  1. The questioner was satisfied and accepted the answer, or
  2. The answer was disputed, but the judge evaluated it as 100% correct.
View the answer
  • Thank you. Also what is the "wlog" in the second sentence?

  • Without loss of generality. It means that I can take q>p or p>q and it doesn't matter.

The answer is accepted.