Select all statements equivalent to "Language A is decidable by a TM."1 pointA is decidable by a C programA is decidable by a Python programA is decidable by a NFAA is decidable by a PDAA is decidable by a context-free grammar

A is some decidable language. Select all statements that are true irrespective of what A is.1 pointHALTS ≤ HALTS'HALTS' ≤ HALTSA ≤ HALTS'HALTS' ≤ A

Select all true statements1 pointThere is a TM that loops on all inputsLet A be any decidable language. There is a TM that loops on exactly the strings not in A.Let A be any decidable language. There is a TM that loops on exactly the strings in A.There is an undecidable language A such that there is a TM that halts on exactly the strings in A.There is an undecidable language A such that the complement of A is decidable.There is a decidable language A such that the complement of A is undecidable.

Let A be some decidable language and let B be some undecidable language. Select all statements that are definitely false no matter what A and B are.1 pointA ≤ AA ≤ BB ≤ AB ≤ BB ≤ HALTSHALTS ≤ B

Select all languages that are known to be decidable.1 point{x}, where x is some specific string{}{x#y#xy | x and y are strings over {a, b}}HALTS = {(M, x) | M halts on input x}{x: x = aba and Goldbach conjecture is True}

Select all true statements, for all A, B1 pointIf A and B are decidable, then A union B is decidable.If A and B are decidable, then A intersection B is decidable.If A union B is decidable, then A is decidable and B is decidable.If A intersection B is decidable, then A is decidable and B is decidable.If A union B is decidable, then A is decidable or B is decidable.If A intersection B is decidable, then A is decidable or B is decidable.