An algorithm for constructing the simplified DFA (Deterministic Finite Automaton) is introduced, which is equivalent to a given regular expression.是什么意思_An algorithm for constructing the simplified DFA (Deterministic Finite Automaton) is introduced, which is equivalent to a given regular expression.在線(xiàn)翻譯_英語(yǔ)_讀音_用法_例句