Q. Which one of the following is FALSE?

(A) There is unique minimal DFA for every regular language
(B) Every NFA can be converted to an equivalent PDA.
(C) Complement of every context-free language is recursive.
(D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

💬 Discuss

✅ Correct Answer: (D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

Published by Mr. Dubey ⭐ 104.82K Points at 19-Sep-2023 08:45 pm in Theory of Computation and Compiler Design

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

55

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate