Q16MCQ1 mark, −0.33Which one of the following is FALSE?(A)There is a 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.Sign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google