Description: 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.
- [ToNfa] - from regular-into DFA
- [REManageAndNFAToDFA] - to complete the formal ceremony to chang
- [FS_Regulator] - I prepared a test is the regular express
- [COMPILEPAPER] - compile detailed design documentation, i
- [[NFA+TO+DFA]] - NFA determination is the process of comp
- [dfa] - By the importation of automatic generati
- [DFA] - Principles of curriculum design to compi
- [Automate] - graphic Automaton simulator,NFA to DFA c
- [Finite_Aut2127819222008] - A Program that can convert your Regular
- [NFA_DFA] - Language implementation using C++ compil
File list (Check if you may need any files):
RegextoDFA\Adjtable.cpp
..........\Adjtable.h
..........\DFA.cpp
..........\DFA.h
..........\EdgeVertex.cpp
..........\EdgeVertex.h
..........\LinkedStack.cpp
..........\LinkedStack.h
..........\main.cpp
..........\RegextoDFA.dsp
..........\RegextoDFA.dsw
..........\RegextoDFA.ncb
..........\RegextoDFA.opt
..........\RegextoDFA.plg
..........\TTable.cpp
..........\TTable.h
RegularExpressiontoDFA.doc
RegextoDFA
Download