Minimum DFA Construction

Question

Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different.

It is given that the minimum DFA has 12 states. But I am getting many more states. Could someone please provide a diagram that involves only 12 states?

Comments

I am gettong 16

---

@shubhanshu @neelesh

Can u provide the DFA

Answer 1

Answer will be 16 it cant be in 12 states.

Comments

I  will explain  where I used trap state in ur transition diagram see in the last but one state u have drawn, on 'a' it is reaching to final state what happens to 'b' of the same state there I have used trap state so on 'b' it is going to trap state( sorry I was unable to upload my transition diagram so I explained in urs correct me if I am wrong)

---

Yeah, You're correct. I forgot about that. There will be a trap other than 16 states.

---

Thanks:)