in Theory of Computation
1,310 views
3 votes
3 votes
What will be total number of final states in NFA for the given regular expression?

$R=(a+b)^{*}b(a+b+\epsilon )$
in Theory of Computation
1.3k views

4 Comments

According to Myhill-Nerode theorem,

No. of equivalence classes = No. of states in Minimal DFA 

1
1
it will be 3.
0
0
I'm also getting the same DFA the ans is going to be 3
0
0

1 Answer

2 votes
2 votes

Check Above 3 state are there.

And 2 final state.

ans is 2.

Related questions