Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems
暂无分享,去创建一个
[1] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .
[2] Jeffrey D. Ullman,et al. The compilation of regular expressions into integrated circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[4] J. Brzozowski. Canonical regular expressions and minimal state graphs for definite events , 1962 .
[5] Wilfried Brauer,et al. On Minimizing Finite Automata , 1988, Bull. EATCS.
[6] Edward F. Moore,et al. Gedanken-Experiments on Sequential Machines , 1956 .
[7] Robert E. Tarjan,et al. A Linear Time Solution to the Single Function Coarsest Partition Problem , 1985, Theor. Comput. Sci..
[8] Barbara Schubert. How to Use Sorting Procedures to Minimize DFA , 1996, Workshop on Implementing Automata.
[9] Y. N. Srikant. A parallel algorithm for the minimization of finite state automata , 1990 .
[10] Wojciech Rytter,et al. Efficient parallel algorithms , 1988 .
[11] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[12] A. Church. Edward F. Moore. Gedanken-experiments on sequential machines. Automata studies , edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, litho-printed, Princeton University Press, Princeton1956, pp. 129–153. , 1958, Journal of Symbolic Logic.
[13] David A. Huffman,et al. The synthesis of sequential switching circuits , 1954 .
[14] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.