Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata
Context sensitive language can be recognized by a:
1
Finite state machine
2
Deterministic finite automata
3
Non-deterministic finite automata
4
Linear bounded automata