minimal Dfa

Question

Comments

@saxena0612 For NFA there would be 5 states, he is asking for DFA

---

Nowhere in problem its mentioned that we have to draw DFA only "MINIMAL FA" refer to states and 5 is matching every constraint Not in options though.

---

well somehow, I was able to derive something which was mentioned in the options, and out of all the questions I have attempted so far and encountered this word called "Minimized FA", the expected answer was always on the basis of DFA only, I am talking on the basis of experiences of what everything I have practiced so far.....
Anyways, You might be correct too, but the most plausible answer as of now has to be 16.

Answer 1

First of all you need to construct the NFA for the given problem, where it asks for the 4th alphabet from the

RHS has to be always 'a'
example- aabbaabb 

once you are done with the NFA, convert to DFA!
 

State	a`	b
q0	q0B	q0
B	C	C
C	D	D
D	E	E
E	phi	phi

For conversion we do the following

State	a	b
q0	q0B	q0
q0B	q0BC	q0C
q0C	q0BD	q0D
q0D	q0BE	q0E
q0E	q0B	q0
q0BC	q0BCD	q0CD
q0BD	q0BCE	q0CE
q0BE	q0BC	q0C
q0CD	q0BDE	q0DE
q0CE	q0BD	q0D
q0DE	q0BE	q0E
q0BCD	q0BCDE	q0CDE
q0BCDE	q0BCDE	qoCDE
q0BCE	q0BCD	qoCD
q0BDE	q0BCE	q0CE
q0CDE	q0BDE	q0DE

Which Totals to 16 states... Hope this helps :)