In: Computer Science
Q5 [15 pts] a) Convert the following NFA to a DFA: 0 1 ---------------------- -> a || {a} | {a,b} b || {c} | {c} c || {d} | {d} d || {e} | {e} * e || {} | {} b) Informally describe the language that it accepts.
b)
The language accepted by the automata must have atleast length 4, where the string contains the characters 0 or 1.
************†PLEASE DON'T FORGET TO GIVE THUMBS UP.. I REALLY NEED IT...