Description: 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)
- [Regular] - input is a regular expression, you can u
- [databasesystems.Rar] - database system for teaching the Chinese
- [REManageAndNFAToDFA] - to complete the formal ceremony to chang
- [nfa] - NFA DFA correlation algorithm compiler p
- [REManageAndNFAToDFA] - Recognition of formal style, be translat
- [DFA] - Regular type conversion DFA
- [RegToFA] - From regular expressions to NFA to DFA i
- [DFA] - Enter the formal ceremony, draw the corr
- [805NFA] - [Using Java language to the DFA' s nf
- [DFA] - Simple DFA finite automata may be based
File list (Check if you may need any files):
正则表达式转换为DFA
...................\Constants.java
...................\DfaFrame.java
...................\EdgeLink.java
...................\Element.java
...................\Graph.java
...................\GraphNode.java
...................\SpecialEdge.java
...................\Transform402.java
...................\TransformFrame.java
...................\TransformModel.java
...................\TransformView.java
Download