Search - java regular expression nfa dfa

Search - java regular expression nfa dfa - List

[JSP/Java] reg2NFA(java) DL : 0: 正则表达式到NFA，NFA到DFA的JAVA实现，图形表示结果。-Regular Expression to NFA, NFA to DFA s JAVA realized, graphical representation of results.
Date : 2025-07-15 Size : 35kb User : 洪兴
[ELanguage] DFA DL : 0: 输入一个正则表达式，输出相应的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)
Date : 2025-07-15 Size : 14kb User : liyingan
[Other] FA DL : 0: 正则表达式->NFA/DFA/最简表达式-Regular Expression-> NFA/DFA/the most simple expression
Date : 2025-07-15 Size : 257kb User : 王据林
[ELanguage] Automate DL : 0: graphic Automaton simulator,NFA to DFA conversion and minimisation
Date : 2025-07-15 Size : 676kb User : darkzan
[ELanguage] bianyisrc DL : 0: 编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过，都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors
Date : 2025-07-15 Size : 18kb User : dai
[ELanguage] lexer DL : 0: 词法分析器，输入正规式，转换成NFA，在到DFA，最小化DFA。用java编写了可视化界面，健壮性强-允许输入拉丁字符的拼音 Lexical analyzer, enter the regular expression, convert the NFA to DFA, minimize DFA. Java prepared a visual interface, robustness
Date : 2025-07-15 Size : 473kb User : yang
[JSP/Java] FiniteAutomaton DL : 0: 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
Date : 2025-07-15 Size : 138kb User : 王聪