Treat a transition based on the empty string as automatic without
needing any input. So if state B has a transition to state C with the
empty string, then when input is read in such that state A transitions
to B, the current states are {B, c} since you can get to C for free.