Automata and Computability (A136) - Show that ANFA is NL-complete.

2DIM-DFA is undecidable - The language define by the equality of two 2DIM-DFA machines on all inputs is undecidable. The full definition of 2DIM-DFA can be found in Sipser's "Introduction to the Theory of Computation" (5.17) I show a reduction to the decidability of a problem which is known to be undecidable and hence prove the undecidability of the original language.

Automata and Computability - See Attached Sheet

Automata and Computability (A138) - See Attached Sheet

Automata and Computability - Prove that an oracle C exists for which NPC  coNPC. See attached file for full problem description.