1,272 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 )$

1 Answer

Related questions

1 votes
1 votes
1 answer
1
kislaya Pant asked May 8, 2018
1,063 views
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
1 votes
1 votes
1 answer
2
smsubham asked Apr 8, 2018
2,595 views
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?