InterviewSolution
Saved Bookmarks
| 1. |
Which one of the following is FALSE?(a) Every NFA can be converted to DFA(b) Every subset of a recursively enumerable set is recursive(c) All of the mentioned(d) None of the mentioned |
|
Answer» Right option is (b) Every subset of a recursively enumerable set is recursive Easiest explanation: Every subset of a recursively enumerable set is recursive. |
|