Q3-iiiMSQMarks unknownWhich of the following problems are undecidable?(A)Membership problem in context-free languages.(B)Whether a given context-free language is regular.(C)Whether a finite state automation halts on all inputs.(D)Membership problem for type 000 languages.Sign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google