0

How can I prove that the language $L = \{0^nw1^n\mid n\geq0,w\in\{0,1\}\}$ is irregular? I've tried the pumping lemma but that seems not to work.

David Richerby
  • 82,470
  • 26
  • 145
  • 239

0 Answers0