Minimal DFA

Question

What will be the number of final and non-final states for the minimal DFA accepting the language which contains all the strings that either begin or end (or both) with 01?

Can anyone provide the DFA diagram for this?

Comments

Is this also correct? It has only 1 final state.

Answer 1

There will total 6 states,

final states 2, non-final states 4

The upper part is for starting with 01,

lower part is for ending with 01

Comments

Thank you so much 

@ Ashwin Kulkarni 

---

Ashwin Kulkarni  Sir, same as contain substring 01

Answer 2

dfa can contain 3 states because in question both is mentioned. Please correct me if I amwrong

 

Comments

bro string 000111010 can be made from ur DFA which is invalid string for above language....