FIRE Lite: FAs and REs in C++
暂无分享,去创建一个
[1] Robert McNaughton,et al. Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..
[2] B. Watson. A taxonomy of finite automata minimization algorithms , 1993 .
[3] Ken Thompson,et al. Programming Techniques: Regular expression search algorithm , 1968, Commun. ACM.
[4] William H. Press,et al. Numerical recipes in C. The art of scientific computing , 1987 .
[5] Bruce W. Watson,et al. The design and implementation of the FIRE engine : a C++ toolkit for finite automata and regular expressions , 1994 .
[6] B. Watson. A taxonomy of finite automata construction algorithms , 1993 .
[7] William H. Press,et al. The Art of Scientific Computing Second Edition , 1998 .
[8] J. Brzozowski. Canonical regular expressions and minimal state graphs for definite events , 1962 .
[9] Jean-Marc Champarnaud,et al. AUTOMATE, a Computing Package for Automata and Finite Semigroups , 1991, J. Symb. Comput..
[10] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .
[11] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[12] Gérard Berry,et al. From Regular Expressions to Deterministic Automata , 1986, Theor. Comput. Sci..
[13] Bruce W. Watson. Implementing and using finite automata toolkits , 1996, Nat. Lang. Eng..