CS 4510 Automata and Complexity Due: 11am Oct 14

Exam 3: Practice
Released: 11am Oct 13

0. Honor Code 1 point

I commit to uphold the ideals of honor and integrity by refusing to betray the trust
bestowed upon me as a member of the Georgia Tech community.
Signature:
1. Short Answer 6 points
(a) For which of the following sets A, B is it possible to have A ⊆ B:
• A is decidable, B is undecidable
• A is undecidable, B is decidable
• A is countable, B is uncountable
• A is uncountable, B is countable.
(b) Which of the following relationships are possible between A and A:
• A is decidable, A is recognizable but not decidable.
• A is recognizable but not decidable, A is recognizable but not decidable.
• A is not recognizable, A is recognizable but not decidable
• A is not recognizable, A is not recognizable.
(c) What is the major flaw with the following proof that L11 = {hM i | L(M ) = {11}
is undecidable?
“Proof:” We will reduce from EQT M . Suppose we have a machine M , and we
wish to know if L(M ) = {11}. Create M 0 as follows: on input y if y = 11 accept,
otherwise reject. Then L(M ) = {11} if and only if M and M 0 accept the same
language. But it is undecidable whether two machines accept the same language.
So L11 is also undecidable.
2. Countability, uncountability
Show that a graph on a countable set of vertices has a countable number of edges.
Show that there are uncountably many functions from a countably infinite set to itself.
3. Decidability and Recognizability
Show that ET M is recognizable. Show that it is not decidable.
Show that if A and B are decidable, then A ◦ B is decidable.
4. Reductions (6 points)
Show that {hM i | L(M ) is infinite} is not decidable.
Show that {(G1 , G2 ) | G1 , G2 are context-free grammars and L(G1 ) = L(G2 )} is not
decidable. Is it recognizable? What about its complement?

3: Practice-1
5. TM equivalence
Show that a PDA with 2 stacks is equivalent in power to a Turing Machine.

3: Practice-2