Answer by J.-E. Pin for Proving L is regular or not using pumping lemma
Suppose that $L$ is regular. Then the language $P = 1^+ - L$ is also regular. Observe that $P = \{1^p \mid p \text{ is prime } \}$. Since $P$ is infinite, the pumping lemma can be applied: there exists...
View ArticleProving L is regular or not using pumping lemma
So I'm trying to prove that the language $L = \{1^n \mid n \text{ is composite}\}$ is either regular or non-regular using the pumping lemma. I wanted to ask if I'm on the right track.So I assume that...
View Article
More Pages to Explore .....
