12

I want to prove that the complement of $\{0^n1^n \mid n \geq{} 0\}$ is not regular using closure properties.

I understand pumping lemma can be used to prove that $\{0^n1^n \mid n \geq{} 0\}$ is not a regular language. I also understand regular languages are closed under complement operation. However, does that also imply that a non-regular language's complement is also non-regular?

Raphael
  • 73,212
  • 30
  • 182
  • 400
anthony34234
  • 121
  • 1
  • 3

1 Answers1

9

Yes. Since the complement of a regular language is also a regular language, then it follows that the complement of a non-regular language must also be non-regular. Strictly speaking, this works since the complement is its own inverse.

Patrick87
  • 12,924
  • 1
  • 45
  • 77