Description: From the NFA to DFA conversion process is the use of information continuously generated NFA state DFA nodes and edges of the process, or to generate automata DFA conversion table of the process elements. Ε-closure order is to connect with ε while the status of the process of merging, the merger will form the state set a state of DFA, the DFA state is expressed as a subset of the state of NFA. With SS (state set) of the form of the state DFA. SS assumptions that the status of the newly elected, the next step is: for each symbol a consideration of its edge and the edge point to state.
To Search:
- [Regular] - input is a regular expression, you can u
File list (Check if you may need any files):
PL0源代码
.........\Debug
.........\.....\pl0.exe
.........\.....\pl0.ilk
.........\.....\pl0.obj
.........\.....\pl0.pch
.........\.....\pl0.pdb
.........\.....\vc60.idb
.........\.....\vc60.pdb
.........\pl0.c
.........\pl0.dsp
.........\pl0.dsw
.........\PL0.h
.........\pl0.ncb
.........\pl0.opt
.........\pl0.plg
.........\set.c
.........\set.h
Download