Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider following statements:
A. A context free language is generated by LR(o) grammar if and only if it is accepted by a deterministic pushdown automata and has prefix property
B. If M1 is the single tape TM simulating multilape TM M, then time taken by M1 to simulate n moves is (n3)
C. Push down automata behaves like a Turning machine when it has one auxiliary memory.
D. L= {anbncn : n ≥ 1} is not context free but context sensitive.
Choose the correct answer from the options given below:
1
A, B and C only
2
A, B only
3
D only
4
B, C only