Finite State Automata Question:

Prove that a Turing Machine can decide the following language:

L = { (F,w) | F is a Finite state automaton that does not accept input w}