Is there any alternate ways to identify if a language is regular/contex-free/context-sensitive etc. from the first sight. (Without using Pumping lemma/Myhill–Nerode theorem(s))
For e.g Identify the following whether the languages are regular/contex-free/context-sensitive etc.
$L1 = \left\{ {(0)^{2n}(10)^{3k+1}1^m }, n, k, m ≥ 0 \right\}, \Sigma = \left\{{0,1}\right\}$
$L2 = \left\{ {a^{n}b^{n}} | n ≥ 0 \right\}$
$L3 = \left\{ {a^{i}b^{j}c^k }, i=j+k \right\}$
$L4 = \left\{ {ww} | w \epsilon {(a,b)}^{*} \right\}$
$L5 = \left\{ {0^{p}1^{q}0^{r} | p,q,r\geq 0}, p\neq r \right\}$
