finite-automata

Finite Automata string not ending with ba


Question: Build an FA that accepts only those words that do not end with ba. I want to Draw DFA for this problem but I don't understand I to do it please help me to draw this


Solution

  • Steps:

    1. Draw DFA which ends with "ba".
    2. Invert the states i.e.
    3. Make the final states, non final.
    4. Non final states, final states

    IMAGE: DFA of strings not ending with "ba":

    enter image description here