Reply To:

Which one of the following is FALSE?
(A) There is a unique minimal DFA for every regular language
(B) Every NFA can be converted to an equivalent PDA
(C) Compliment of every context-free language is recursive
(D) Every non-deterministic PDA can be converted to an equivalent deterministic PDA

Home Modern › Forums › ISRO ›

Which one of the following is FALSE?
(A) There is a unique minimal DFA for every regular language
(B) Every NFA can be converted to an equivalent PDA
(C) Compliment of every context-free language is recursive
(D) Every non-deterministic PDA can be converted to an equivalent deterministic PDA

› Reply To:

Which one of the following is FALSE?
(A) There is a unique minimal DFA for every regular language
(B) Every NFA can be converted to an equivalent PDA
(C) Compliment of every context-free language is recursive
(D) Every non-deterministic PDA can be converted to an equivalent deterministic PDA