What to do with empty set during NFA to DFA conversion? I am currently converting this NFA to a DFA



I have come up with the following DFA:

        0      1
-&gt;A    {A}    {B}
  B    {CA} 
*CA    {A}    {AB}
 AB    {CA}   {B}


Although, I have no idea what to put for B. In the NFA, upon the B receiving 1 input, it goes nowhere - assumable unaccepted by the NFA. Do I send the DFA to a new, dead state upon receiving input 1 whilst in B?

I can try it:

        0      1
-&gt;A    {A}    {B}
  B    {CA}   {}
*CA    {A}    {AB}
 AB    {CA}   {B}
 {}    {}     {}


But is this correct by the rules of DFA?
Creating a new sink state is perfectly fine. The empty set is also a subset of all states.

In most DFA diagrams this state is omitted for simplicity.