For every NFA a deterministic finite state machine (DFA) can be found that accepts the same language.

• 保持机器当前可能处在的所有状态的集合数据结构。