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.
-
Low bounty!
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.
-
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.
- answered
- 109 views
- $13.00
Related Questions
- Prove that $tan x +cot x=sec x csc x$
- Linearly independent vector subsets.
- Compounding interest of principal P, where a compounding withdrawal amount W get withdrawn from P before each compounding of P.
-
The given equation is x² - 2mx + 2m - 1=0
Determine m. - Representation theory question
- Algebra Word Problem 3
- Is the $\mathbb{C}$-algebra $Fun(X,\mathbb{C})$ semi-simple?
- MAT-144 Assignment