Automata and Computability - Show that the problem of testing whether two branching programs compute the same function is solvable in polynomial time if and only if P = NP

Automata and Computability (A128) - See Attached Sheet

Automata and Computability - See Attached Sheet

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

Automata and Computability - Give a circuit that computes the parity function on three input variables and show how it computes on input 011. See attached file for full problem description.