[1] HOPCROFT J E, MOTWANI R, ULLMAN J D. Introduction to automata theory, languages, and computation [M]. 2nd ed. Boston: Addison Wesley, 2000.[2] 陈火旺,钱家骅,孙永强.程序设计语言编译原理[M].3版.北京:国防工业出版社,2000.[3] ALMEIDA J, ZEITOUN M. Description and analysis of a bottom-up DFA minimization algorithm [J]. Information Processing Letters, 2008, 107(2): 52-59.[4] MOORE E F. Gedanken-experiments on sequential machines [M]// Automata Studies. Princeton: Princeton University Press,1956: 129-153.[5] BASSINO F, DAVID J, NICAUD C. Average case analysis of Moore's state minimization algorithm [J]. Algorithmica, 2012, 63(1/2): 509-531.[6] DAVID J. The average complexity of Moore's state minimization algorithm is O(n log log n) [C]// Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science. Berlin: Springer-Verlag, 2010: 318-329.[7] HOPCROFT J E. An n log n algorithm for minimizing the states in a finite automaton [M]// Theory of Machines and Computations. Stanford, CA: Stanford University, 1971: 189-196.[8] TEWARI A, SRIVASTAVA U, GUPTA P. A parallel DFA minimization algorithm [C]// Proceedings of the 9th International Conference on High Performance Computing. Berlin: Springer-Verlag, 2002: 34-40.[9] 孙玉强,李玉萍,王海燕,等.确定有限自动机最小化算法的并行处理[J].计算机科学,2008,35(1):298-300.[10] PAWLAK Z. SKOWRON A. Rudiments of rough sets [J]. Information Sciences, 2007, 177(1): 3-27.[11] 葛浩,李龙澍,杨传健.一种核属性快速求解算法[J].控制与决策,2009,24(5):738-742.[12] CORMEN T H, LEISERSON C E, RIVEST R L, et al. Introduction to algorithms [M]. 3rd ed. Cambridge, MA: MIT Press, 2009. |