Resolved
How pumping lemma can be used to prove that any language is not a regular language? Show that language, L = {0n1n | n>0} is not a regular language.
- Answered by
- 0 Comments
- 9 months ago
This answer is restricted. Please login to view the answer of this question.
Login Now
