In: Computer Science
L= {w belongs to {0,1}* | the number of 0's is a prime number} . Prove that the language L is not regular.
Solution:
If a language doesn't satisfy any of these 3 condition then it does not belongs to regular language.
NOTE:
If you are satisfied with my answer please do upvote and if you
have any kind of doubts please post in the comment section. I'll
surely help you there.
Thank You:)