Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Which of the following are True?
S1: Every NFA can be converted to equivalent PDA
S2: Whether a given CFL is Regular is decidable.
S3: Equivalance of two DCFLs is undecidable.
S4: Finiteness of CFLs is decidable
1
S1 and S3 only
2
S2 and S3 only
3
S1 and S4 only
4
S1, S3 and S4 only