Consider $L=L_1 \cap L_2$ where
$L_1 = \{ 0^m 1^m 20^n 1^n \mid m,n \geq 0 \}$
$L_2 = \{0^m1^n2^k \mid m,n,k \geq 0 \}$
Then, the language $L$ is
sir L2 is not regular .observe 2^k we can not draw finite automata for this.
64.3k questions
77.9k answers
244k comments
80.0k users