For this FA design a Turing that emulates this DFA

Finite Automata: Examples and Definitions (con?'d.) a, b (l 4o 42 This FA accepts strings that contain abbaab. What do we do when a prefix of abbaab has been read but the next symbol doesn't match? Go back to the state representing the longest prefix of abbaab at the end of the new current string. Finite Automata: Examples and Definitions (con?'d.) a, b (l 4o 42 This FA accepts strings that contain abbaab. What do we do when a prefix of abbaab has been read but the next symbol doesn't match? Go back to the state representing the longest prefix of abbaab at the end of the new current string