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.
25
Answer
Answers can be viewed only if
- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

1.6K
-
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 50% commission on every question your affiliated users ask or answer.
- answered
- 451 views
- $13.00
Related Questions
- Determine the angle
- How do you go about solving this question?
- Multiplying Polynomials
- Need Help with Piecewise Function and Graphing it
- Value Of Investment
- Calculating Speed and Velocity
- Attempting to make a formula/algorithm based on weighted averages to find how much equipment we need to maintain.
- Artin-Wedderburn isomorphism of $\mathbb{C}[S_3]$
Low bounty!