Self doubt TOC DFA

Question

Construct a minimal DFA which accepts set of all strings over {a,b}, such that

$1)$Second symbol from $RHS$ should be $‘a’$

$2)$Third symbol from $RHS$ should be $‘a’$

Comments

bro, the safe approach is to  first draw the nfa and convert that nfa to dfa . try it otherwise i will post you the solution

---

I'm so much confused can you give me the solution?

---

@Lakshman Patel RJIT ofcourse bro.

Answer 1

2nd part AND 1st part.

 

Comments

@Lakshman Patel RJIT  bro this is the approach

---

Yes, very nice answer.

$NFA\rightarrow DFA$

$DFA\rightarrow NFA$

$NFA\equiv DFA$

So, both are equivalent in power.

$\Rightarrow$ Every  $DFA$ is $NFA,$ but reverse need not be true.

Please correct me if I'm wrong?