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.
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
- 779 views
- $13.00
Related Questions
- Recursive square root sequence
- Solving for two unknown angles, from two equations.
- Let $f(x,y,z)=(x^2\cos (yz), \sin (x^2y)-x, e^{y \sin z})$. Compute the derivative matrix $Df$.
- Algebra Question
- Certain isometry overfinite ring is product of isometries over each local factor
- Need Upper Bound of an Integral
- How do you do absolute value equations with inequalities?
- Does $\lim_{n \rightarrow \infty} \frac{2^{n^2}}{n!}$ exist?
Low bounty!