Self Doubt

Question

Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.

Comments

I am getting 8 stages in which it has 3 final state.

---

Shubhanshu

correct!!.

Please explain ??

Answer 1

Here it is!!!​​​​​​

Comments

Thanks alot @kumar.dilip .
Any further changes are most welcome.

---

Shubhanshu

I think we can merge two final states of 00(0+1)* + 11(0+1)*.into one.

So, the total number of states will be 8.

Thanks.

---

Yeah. Thanks.