Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Compliment of the language
\(L = \left\{ {{{{a^n}{b^n}{c^n}}}{{ |\ n \ge 0}}} \right\}\) is
1
A regular language
2
A context free language but not Regular
3
A CSL but not CFL
4
Recursive but not CSL
5
Question Not Attempted