# Handling dead state in NFA to DFA conversion

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.

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)$.
• There is no "corresponding state" for $C$ in the DFA, since $C$ always occurs together with other possible NFA states, which provide the possible transitions. If the singleton state $\{C\}$ was reachable in the DFA, it would indeed be a dead state. – Klaus Draeger May 15 '15 at 16:28