实验：NFA 转 DFA (子集构造法)
输入正则表达式，先生成 NFA（Thompson 算法），再演示将其转换为 DFA 的过程，包含详细的子集构造步骤。
Supports:
Simplified Mode: Merges states during NFA construction to reduce ε-transitions, which simplifies the subsequent Subset Construction.
( ), | (union), * (closure), concatenation (implicit). Simplified Mode: Merges states during NFA construction to reduce ε-transitions, which simplifies the subsequent Subset Construction.
Step 1: NFA (Thompson)
Step 3: DFA
* Labels like
{0,1,2} indicate the set of NFA states merged into this DFA state.