How can I make a finite automaton which does not end in string ab.
With the alphabet a,b
I made 3 states. For the first one it is accepting states and thus accept the empty string.
So here is a table I made. State 1 is initial state
input goes to state input goes to state
b 1 a 2
b 3 a 2
b 3 a 3
But will it work?