![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
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. |
Answer» D. Every nondeterministic PDA can be converted to an equivalent deterministic PDA. |
View all MCQs in
Theory of Computation and Compiler DesignNo comments yet