有穷自动机状态极小化方法及正则语言判定优化

Definite Finite Automaton State Minimization Methods and Regular Language Recognizing Optimization

引入了等价性原则，定义等价关系的商集合互∑^＊／～B，通过对商集合的有限性判断，来判定正则语言，大大简化了正则语言判定的步骤，并在有穷自动机的状态集上引入了等价关系，对等价状态进行压缩，构造出与其等价的最小有穷自动机，同时降低了有穷自动机状态的复杂性．

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.