Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Context free grammar can recognise:
1
Two way linear bounded automata
2
Push down automata
3
Both Two way linear bounded and Push down automata
4
Neither Two way linear bounded nor Push down automata
5
Question Not Attempted