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 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](https://matchmaticians.com/storage/user/100977/thumb/matchmaticians-ee0kis-file-1-avatar-512.jpg)
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
- 847 views
- $13.00
Related Questions
- Find $a,b,c$ so that $\begin{bmatrix} 0 & 1& 0 \\ 0 & 0 & 1\\ a & b & c \end{bmatrix} $ has the characteristic polynomial $-\lambda^3+4\lambda^2+5\lambda+6=0$
- How to properly write rational exponents when expressed as roots?
- Closest Points on Two Lines: How to use algebra on equations to isolate unknowns?
- Zariski Topology and Regular Functions on Algebraic Varieties in Affine Space
- Find an expression for the total area of the figure expressed by x.
- Allocation of Price and Volume changes to a change in Rate
- Module isomorphism and length of tensor product.
-
The given equation is x² - 2mx + 2m - 1=0
Determine m.
Low bounty!