build a finite automata that accept only those words that do not end with ba, with alphabet {a,b}. how to solve this question. how to know that what input we take. plz help me in this subject

Question

anonymous · Answer

First, you'll need to figure out how many states you'll need and give them a good and understandable name. I think your example can be done in three states. As for the name, it's best to choose something like "I've seen an 'a' followed by a 'b'".

Once you've got that figured out, you'll need to check what happens when the input is an 'a' and when the input is a 'b'. Which state should you go to, or do you stay in the same state?