240 views
2 votes
2 votes
Consider the language $L=$ {$a^n:n$ is not a perfect square}.
(a) Show that this language is not regular by applying the pumping lemma directly.
(b) Then show the same thing by using the closure properties of regular languages.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
4