Problem Detail: I want to convert below NFA into DFA: 
I prepared below tables and finally the NFA: 
NFA 
However I feel I am wrong here, since original NFA does not have any transitions defined for state C and my final DFA does not have any dead state. However I dont understand where I am going wrong.
I prepared below tables and finally the NFA: NFA However I feel I am wrong here, since original NFA does not have any transitions defined for state C and my final DFA does not have any dead state. However I dont understand where I am going wrong.Asked By : Mahesha999
Answered By : Ran G.
Your DFA actually looks correct. Why do you need a dead state? A dead state means the automaton was given a prefix of an input that will never lead to an accepting state. But the language of the NFA has no such prefixes – whatever the prefix is, if you add “10” or “11” you will get to an accepting state. Anyways, the right thing to do now is to verify that the DFA works fine for several sample inputs. More generally, to prove it actually does decide the language generated by $(0+1)^*1(0+1)$.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/42595
