Draw a Finite State Machine for the following language:
.-{x є (ab.el’: x has at least one a before any b) Show transcribed image text .-{x є (ab.el’: x has at least one a before any b)
Answer
odleast one a before any b 〉 Lnust accept t’e, a”, e DFA to о- Dead Stee a,b,