An algorithm for constructing the simplified DFA (Deterministic Finite Automaton) is introduced, which is equivalent to a given regular expression.

• 摘要介绍了构造等价于给定正则表达式的简化确定有限自动机(DFA)的算法。