construct a DFA of the language containing the set of all strings over {a, b} which accepts strings with length > 3 and the first digit from LHS is different from the third digit on the RHS

Question

Ex. (baaab, babababa, aaabbaaabbb)

Ex. (babab, abaaabb, aaaa, bbab)

Comments

Mention source of the question, in the Title. And Type your question in question description area.

---

this is how the NFA should look like in my opinion. I tried to convert it into a DFA(took me almost an hour) but wasn’t able to because the number of states were increasing with every step. I don’t think you can make a DFA using a pen and paper for this particular question.