Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
正则表达式为 01(0+1) * |0 +
我想将其转换为最小化的 DFA。JFlap 似乎不支持给定的正则表达式，我如何验证表达式是否具有 Kleene 的闭包？
如果它接受这样的表达式，是否有特殊的语法来输入它们？