0

Show that the language $\{0^n1^m0^n| m,n\in \mathbb{N}\}$ is not regular using closure properties.

I tried showing this using pumping lemma but I am stuck when it comes to closure properties. Please help me out!

kk1997
  • 1

0 Answers0