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 )$ Theory of Computation theory-of-computation minimal-state-automata finite-automata number-of-states + – rahul sharma 5 asked Aug 4, 2017 rahul sharma 5 1.3k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments just_bhavana commented Aug 4, 2017 reply Follow Share According to Myhill-Nerode theorem, No. of equivalence classes = No. of states in Minimal DFA 1 votes 1 votes joshi_nitish commented Aug 5, 2017 reply Follow Share it will be 3. 0 votes 0 votes sanju77767 commented Apr 9, 2018 reply Follow Share I'm also getting the same DFA the ans is going to be 3 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Check Above 3 state are there. And 2 final state. ans is 2. Bhargav D Dave 6 answered Oct 31, 2017 Bhargav D Dave 6 comment Share Follow See all 0 reply Please log in or register to add a comment.