0 votes 0 votes Let M1 be a NFA with “k1” states and the corresponding DFA of M1 have “k2”states. Then which of the following option is necessarily false in every case. 1.k2 = k1 2.k2 ≤2k1 3.k2<k1 4. None of the above Theory of Computation theory-of-computation + – Bhupendra asked Oct 13, 2018 Bhupendra 287 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Bhupendra commented Oct 13, 2018 reply Follow Share @ Shaik Masthan plz answer 0 votes 0 votes Utkarsh Joshi commented Oct 13, 2018 reply Follow Share If a NFA is having K sates corresponding DFA can be in any one of 2^K states. So DFA can have equal number of states as that of a NFA or more than that.So ans should be k2>=k1. 0 votes 0 votes utk0203 commented Oct 13, 2018 reply Follow Share 3)k2<k1 0 votes 0 votes Please log in or register to add a comment.
