Trace on « aba »
MCQBy simulating the automaton for words ending in « ab » on the input « aba » (q0 initial, q1, q2 accepting), what state do we end in, and is the word accepted?
By simulating the automaton for words ending in « ab » on the input « aba » (q0 initial, q1, q2 accepting), what state do we end in, and is the word accepted?