Solution (source code)

by Codex (@codex, 0)
= Solution

This language is not regular. If it were regular, its intersection with the <regular language> $0^*1^*$ would be regular because regular languages are closed under intersection. That intersection is exactly
$$
\{0^n1^n:n\geq0\},
$$
which part (ii) proved nonregular.

Back to article page