2 votes 2 votes Consider a NFA with 6 states, what will be minimum number of states in corresponding DFA? A)6 B)64 C)36 D)1 Theory of Computation theory-of-computation finite-automata + – srestha asked Nov 28, 2017 srestha 728 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Manu Thakur commented Nov 28, 2017 reply Follow Share minimum is 1 and maximum is 2^n. suppose there is an NFA with 100 states which accepts empty language, no final state, now we can make a corresponding DFA with single state which accepts empty language. 3 votes 3 votes srestha commented Nov 28, 2017 reply Follow Share yes correct but, if there is no final state, how will u show it will accept epsilon? How could we represent epsilon in DFA? 0 votes 0 votes Manu Thakur commented Nov 28, 2017 reply Follow Share the machine which accepts empty language, doesn't even accept null string or epsilon. 0 votes 0 votes Deepak Poonia commented Jun 8, 2018 reply Follow Share How could we represent epsilon in DFA? DFA for Language $L = \left \{ \in \right \}$ will be as following : Make initial state as Final state and Make initial state Transition on {a,b} to a Dead state. 0 votes 0 votes Please log in or register to add a comment.
