Q1.16MCQMarks unknownWhich of the following conversions is not possible (algorithmically)?(A)Regular grammar to context free grammar(B)Non-deterministic FSA to deterministic FSA(C)Non-deterministic PDA to deterministic PDA(D)Non-deterministic Turing machine to deterministic Turing machineSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google