References
- Champarnaud , J.-M. (2001) . Subset construction complexity for homogeneous automata position automata and ZPC-structures . Theoret. Comp. Sc. , 267 : 1–2, 17–34
- Caron , P. and Ziadi , D. (2000) . Characterization of Glushkov automata . Theoret. Comp. Sc. , 233 : 75 – 90 .
- Ponty , J.-L. (2000) . An efficient null-free procedure for deciding regular language membership . Theoret. Comp. Sc. , 231 : 89 – 101 .
- Navarro G. Raffinot M. (2001) Compact DFA representation for fast regular expression search In: G. S. Brodal, D. Frigioni, A. Marchetti-Spacamella (Eds.) Lecture Notes in Computer Science, 5th Workshop of Algorithm Engineering No. 2141 Springer-Verlag Berlin pp. 1–12
- Champarnaud J.-M. (2002) A propos du calcul exhaustif du déterminisé d'un automate homogène Manuscript
- Coulon F. (2003) CCP—a compact fast algorithm for regular expression search Source codehttp://www.univ-rouen.fr/LIFAR/aia/ccp.html
- Yu S. (1997) Regular languages In: G. Rozenberg, A. Salomaa (Eds.) Handbook of Formal Languages. Word, Language, Grammar I Springer-Verlag Berlin pp. 41–110
- Navarro G. Raffinot M. (2002) Flexible Pattern Matching in Strings—Practical On-line Search Algorithms for Texts and Biological Sequences Cambridge University Press (ISBN 0-521-81307-7)
- Wu S. Manber U. (1992) Fast text searching algorithm allowing errors CACM 35 (10) October pp. 83–91
- Brüggemann-Klein , A. (1993) . Regular expressions into finite automata . Theoret. Comp. Sc. , 120 : 197 – 213 .
- Chang C.-H. Paige R. (1992) From regular expression to DFAs using NFAs In: A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.) Lecture Notes in Computer Science, 3rd Symposium on Combinatorial Pattern Matching No. 664 Springer-Verlag Berlin pp. 90–110
- Ponty J.-L. Ziadi D. Champarnaud J.-M. (1997) A new quadratic algorithm to convert a regular expression into an automaton In: D. Raymond and S. Yu (Eds.) Lecture Notes in Computer Science, First Workshop on Implementing Automata No. 1260 Springer-Verlag Berlin pp. 109–119