97 views
Ques:- How to create minimal DFA over w where w belongs to (a,b)* such 2nd symbol from RHS should be 'a'?

4 states is required.

0
Hi Abhishek,

Thanks for your solution but just I had one doubt Why in NFA diagram we are not having any transition for a,b means why it is 'phi'.

Thanks
+1
Regular expression to nfa conversion is easy . And we can easylly convert  nfa to dfa .

R.E------> nfa-------> dfa
0

The minimum number of states required in a minimal dfa for a string with nth symbol from RHS will be 2​​​​​​n.

So in this case second symbol from RHS will give 4 states

0
0
In NFA  at state C we do not have any path for inputs a or b, hence "phi" is taken as empty or none value.