[Quiz—3 (online)] Summer 2021: CSE 309: Theory of Automata

Thursday, July 15, 2021. Total Marks: 10, Duration: 15 minutes

— SOLUTION —
Question 1 [2 points]
Which of the following are models equivalent to the deterministic Turing machine?
(a) Multi-tape Turing machine
(b) Nondeterministic Turing machine
(c) Enumerators
(d) All of the above

Question 2 [2 points]
A Turing machine can have infinitely many states.
(a) True
(b) False

Question 3 [2 points]
Consider a Turing machine M such that:

L(M ) = {w : w ∈ {0, 1}∗ , w ends in 1 and |w| = p, where p is a prime number}.

How many strings of length 9 are there in L(M )?

(a) 256
(b) 10
(c) 0
(d) 64
(e) 16

Question 4 [2 points]
Let A be a Turing-recognizable language and B be an arbitrary proper subset of A. Is B
necessarily a Turing-recognizable language?
(a) Yes
(b) No

Question 5 [2 points]
∗ ∗
Let A = {hGi : G is a CFG over {0, 1} and 1 is a subset of L(G)}. Is A decidable?
(a) Yes
(b) No