期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2013
卷号：4
期号：4-4
出版社：Seventh Sense Research Group
摘要：In algorithm design, DFA minimization is an important problem. DFA minimization is based on the notion of DFA equivalence Two DFA’s are called equivalent DFA’s if and only if they accept the same strings of same set. A large number of computational problems can be solved easily by the encoding method. We can encode the combinatorial objects which we want to use as strings over a finite alphabet. If a DFA accept the collection of encoded strings, then standard algorithms from computational linear algebra can be efficiently used to solve the computational problems.
