Description: Simple DFA finite automata may be based on the input state transition table for state transitions, the input string to determine that the automatic machine is acceptable. And have specific reporting instructions.
- [regular_to_DFA] - Translation principle--- regular expres
- [NFA] - achieve NFA Number algorithm to determin
- [FSMGenerator10b7_manual] - FSM (finite state machine) code generato
- [DFA] - Determine the type of the realization of
- [DFA] - Enter a regular expression, the output c
- [RE2eNFA] - Regular Expression to Epsilon-NFA
- [Dfa] - 利用有穷确定自动机M=(K,Σ,f, S,Z）行为模拟程序算法，来对于任意给定的
File list (Check if you may need any files):
dfa.c
DFA文档.doc
Download