

MCQOPTIONS
Saved Bookmarks
1. |
Which one is a FALSE statement? |
A. | There exists a unique DFA for every regular language |
B. | NFA can always are converted to a PDA |
C. | Complement of CFL is always recursive |
D. | Every NDFA can be converted to a DFA |
Answer» E. | |