Definite Finite Automaton State Minimization Methods and Regular Language Recognizing Optimization
Xiaofeng Wang · Journal of Guangxi University for Nationalities · 2008
In this paper,we import the principle of equivalence,define equivalence regulation of quotient set ∑*/~B,by limited of quotient set,we recognize language is the Regular language,this way such that recognize Regular language is very simple,and we also import the principle of equivalence in the state of DFA,Constructed with the equivalent of the minimum DFA,reduce the DFA the complexity of the state.