搜索资源列表
nfatodfa
- other tool nfa convert to dfa by java language
main1
- nfa to dfa conversion
Compilers
- Here you can draw states and linkers to creat a NFA or DFA.
objectorientedDFA
- enter user a nfa and convert nfa to dfa
Convert_NFA_TO_DFA
- Converting nfa to dfa in java
retodfa
- 正则表达式到有限自动机的转换,编译原理的课程设计，做的不错-RE->DFA
DFA
- 输入：任意的压缩了的上下文无关文法。 输出：相应识别活前缀的DFA。-Input: compressed arbitrary context-free grammar. Output: The corresponding identification of living prefix DFA.
RegEx2NFA2DFA_RC
- 由正则表达式构造DFA的程序，并可以对输入串模拟正则表达式匹配-This is a C program used in compiling the given regular expression into an equivalent DFA, simulated through tracking State sets.
DFA
- converts dfa expression into
nfatodfa
- nfa 转化为 dfa 能够运行成功，我自己已经实验过了，欢迎下载-nfa dfa able to run into a success, I have experimented with, and welcome to download
DFA
- to accept any string from 0`s and 1`s and drow DFA
DeterministicFiniteAutomata_JAVA
- This program is used in a language examination of the DFA. DFA is one type of FA where there is only one alternative state transitions from one state to another using the same input. In this program users can create a new DFA and DFA can be done in
dfa
- 支持向量机的matlab代码，根据自己需要修改即可-Support vector machine matlab code can be modified according to their needs
DFAMinimize
- 编译原理中的DFA最小化实现方法，用C语言实现-DFA Compilation Principle of minimum realization method, using C language
DFASimplificationAnimprovedmethod
- 算法分析；DFA化简算法的一种改进方法；pdf版；学报-Algorithm analysis DFA Simplification of an improved method pdf version Technology
Minimize
- Huffman Minimization algorithm.Accepts only DFA as input.
TransformExprTODFA
- 正则表达式转NFA NFA转DFA DFA最小化 测试字符串是否匹配-Transfer NFA NFA regular expression to minimize transfer DFA DFA test whether the string matches
NFAtoDFA(CPP)
- 用c++编程求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 -C++ programming with regular expressions to find NFA (not sure of the finite automata), NFA to DFA and DFA (finite automata) of the minimum
NFAtoDFA
- It s a program that convert NFA(Non deterministic Finite Automata) to DFA(Deterministic Finite Automata). This article used in scanners and parsers to detect some pattern of input characters similar to tokens.
DFA.CPP
- This program is used to convert regular expression into DFA.