Q48MCQ2 marks, −0.5Which of the following statements is false?(A)Every NFA can be converted to an equivalent DFA(B)Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine(C)Every regular language is also a context-free language(D)Every subset of a recursively enumerable set is recursiveSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google