engineering recuitment ISRO Scientist Computer Science Mock Test Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Which of the following statement is true?
1
Deterministic context free language are closed under complement.
2
Deterministic context free language are not closed under Union
3
Deterministic context free language are closed under intersection with regular set
4
All of the options