Question

Create an Finite Automata that does not end at ab and ba only.

Answer 1

What I do is write an automata that does end at 'ab' and 'ba'. Once I have that one, I 'invert' whether or not the automata accepts a state as end.

So if in the automata I wrote a state is non accepting, it becomes a state that accepts the input, etc.