Question

Design DFA contain all strings of a's and B's which each string starts with 'ab' and end with 'ab'.

Answer 1

I hope this is correct DFA, Thank you.a

Comments

S3 AND S6 which are final states can be combined together . so minimal dfa will have  6 states

---

yes you are right.

---

@prajjwal_191if we do self loop on s3 for b then what is the use of taking another state s7 ? Is the below sol correct or wrong ?

---

@Arpita Maske then it will accept some strings like  ‘abbb’ , ‘abb’ etc ,which are not part of our language as they are starting with ‘ab’ but not ending with ‘ab’ .

so it is not correct.