-
Which of the following statements is false?
-
- Every NFA can be converted to an equivalent DFA
- Every non-deterministic turing machine can be converted to an equivalent deterministic turing machine
- Every regular language is also a context-free language
- Every subset of a recursively enumerable set is recursive
- Every NFA can be converted to an equivalent DFA
Correct Option: D
Option (a) True : Non-deterministic finite automata can be converted into the deterministic finite automata.
Option (b) True : With reference to option (a), same is with the non-deterministic turing machine.
Option (c) True : Regular language is always contextfree but the reverse is not true.
Option (d) False : We know that a set is a subset of itself and hence, every subset of recursively enumerable set is not recursive.
