engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Regular Languages
Given L = \(\left\{ {{a^n}{b^n}{a^n}\;|\;1 \le n \le {{10}^6}} \right\}\)
\({\rm{\bar L}}\) is _____
1
CSL but not CFL
2
CFL but not DCFL
3
DCFL but not regular
4
Regular