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. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation pumping-lemma regular-language closure-property + – Naveen Kumar 3 asked Apr 11, 2019 Naveen Kumar 3 240 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.