in Theory of Computation
153 views
1 vote
1 vote
Show that the language $L=$ {$a^nb^n:n\geq0$}  $\cup$ {$a^nb^{n+1}:n\geq0$} $\cup$ {$a^nb^{n+2}:n\geq0$} is not regular.
in Theory of Computation
153 views

Please log in or register to answer this question.

Related questions