0 votes 0 votes An NFA has 11 states of which 5 are final .If we convert this NFA into DFA atmost how many states can be final states ? Theory of Computation regular-language finite-automata + – Ravi_1511 asked Nov 8, 2016 retagged Jun 4, 2017 by Arjun Ravi_1511 615 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes NFA has 11 states out of which 5 are final 6 are non final states .So number of non final states in DFA=2^6 = 64 Total states possible = 2^11 So final states = total - non final = 2^11 - 2^6 =1984 Prabhanjan_1 answered Nov 8, 2016 selected May 5, 2017 by Praveen Saini Prabhanjan_1 comment Share Follow See all 4 Comments See all 4 4 Comments reply Ravi_1511 commented Nov 8, 2016 reply Follow Share Got it..thnxx 0 votes 0 votes Sachi Saxena commented May 5, 2017 reply Follow Share if the question would be, An NFA has 11 states of which 5 are final .If we convert this NFA into DFA atmost how many states DFA has? then how will we solve this??? 0 votes 0 votes Swati Rauniyar commented Jul 7, 2017 reply Follow Share Why didn't we directly calculated no. of final states= 2^5 ? 0 votes 0 votes Harshitha 123 commented Jun 12, 2018 reply Follow Share Sir, but of these 2^6 combination of states one is empty state that is { } so shouldn't we substract 1 from the answer. 0 votes 0 votes Please log in or register to add a comment.