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.
Proving that $\{0^nw1^n\mid n\geq 0, w\in\{0,1\}\}$ is irregular
regular languages