engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata
Which of the following are True?
S1: Every NFA can be converted to equivalent PDA
S2: Whether a given CFL is Regular is decidable.
1
S1
2
S2
3
Both
4
None