⚡ Only for first 10 students 👉 15 CAT mocks & 45 sectionals for just ₹ 999. Grab now
Which one of the following is FALSE?
There is a unique minimal DFA for every regular language
Every NFA can be converted to an equivalent PDA
Compliment of every context-free language is recursive
Every non-deterministic PDA can be converted to an equivalent deterministic PDA
Create a FREE account and get:
Ask doubts feature is currently unavailable for you. You can reach us at firstname.lastname@example.org for any further details/doubts.
Boost your Prep!