Description: 输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成）
-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first table structure generated by a subset of re-painting DFA graph), DFA minimization (also requires drawing method) Platform: |
Size: 14336 |
Author:liyingan |
Hits:
Description: 编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过，都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors Platform: |
Size: 18432 |
Author:dai |
Hits:
Description: Java实现有限自动机相关功能的工具包，包含：正则式与NFA,DFA的相互转化；DFA的交、并、差、补运算；判断一个DFA对应的正则集是否是无限集；列出一个有限正则集所包含的所有字符串，以及包含字符串的最小长度和最大长度；判断两个最小化DFA是否等价等。
代码已开源：https://a1e2w3@bitbucket.org/a1e2w3/dfa4java.git-Java implementation of finite automata related functions toolkit includes: transformation between regular expression, NFA and DFA. The intersect, complement, substract and union operation of DFA. Judge whether the corresponding regular sets of a DFA is an infinite set. Lists all the strings contain in a finite regular set, and calculate the minimum and maximum length of the strings contains. Determine whether the two minimized DFA equivalence or not, and so on.
Code is open source: https://a1e2w3 @ bitbucket.org/a1e2w3/dfa4java.git Platform: |
Size: 141312 |
Author:王聪 |
Hits:
Search - java regular expression nfa dfa