Location:
Search - RegextoDFA
Search list
Description: 正则表达式转DFA，设计原理：1正则表达式转换为带ε的NFA（Thompson构造法）；2ε-NFA转为DFA；3最小化DFA；4DFA状态转换表判断是否接受输入字符串，附有详细文档说明。-Regular expressions turn DFA, design principles: a regular expression is converted to ε of the NFA (Thompson Construction Law) 2ε-NFA to DFA 3 minimal DFA 4DFA state transition table to determine whether to accept the input string, accompanied by detailed documentation.
Platform: |
Size: 84992 |
Author: 王乾坤 |
Hits: