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
- 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.
Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.
- answered
- 225 views
- $13.00
Related Questions
- Five times the larger of two consecutive odd integers is equal to one more than eight times the smaller. Find the integers.
- Use Rouche’s Theorem to show that all roots of $z ^6 + (1 + i)z + 1 = 0$ lines inside the annulus $ \frac{1}{2} \leq |z| \leq \frac{5}{4}$
- Let $R$ be an integral domain and $M$ a finitely generated $R$-module. Show that $rank(M/Tor(M))$=$rank(M)$
- The last six digits of the number $30001^{18} $
- Algebra 2 help Please find attachment
- Solving Inequalities
- Differentiate $f(x)=\int_{\sqrt{x}}^{\arcsin x} \ln\theta d \theta$
- Evaluate $\int \ln(\sqrt{x+1}+\sqrt{x}) dx$
Low bounty!