Prove that language L = {a^p ; p is prime} isn't regular using MyhillNerode theorem.
Prove that language L = {a^p ; p is prime} isn't regular using MyhillNerode theorem.
Iamjustjerry
25
Answer
Answers can only be viewed under the following conditions:
 The questioner was satisfied with and accepted the answer, or
 The answer was evaluated as being 100% correct by the judge.
Alessandro Iraci
1.7K

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.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
 answered
 661 views
 $13.00
Related Questions
 Algebra Question 3
 Confused on this graph question, not sure how to reduce it to linear and It looks too wonky to draw a best fit line, probably won't take long
 How to find specific heat of a turpentine question?
 Generating set for finitely generated submodule of finitely generated module
 Attempting to make a formula/algorithm based on weighted averages to find how much equipment we need to maintain.
 Fields and Galois theory
 Find $x$ so that $\begin{pmatrix} 1 & 0 & c \\ 0 & a & b \\ \frac{1}{a} & x & x^2 \end{pmatrix}$ is invertible
 Algebra Word Problem 1
Low bounty!