On NFA reductions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3113, Issue , 2004, Pages 112-124

  Ilie, Lucian ^a   Navarro, Gonzalo ^b   Sheng, Yu ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; ROBOTS;

MEMORY REQUIREMENTS; NONDETERMINISTIC FINITE AUTOMATON; NUMBER OF STATE; PREORDERS; REDUCTION ALGORITHMS; REGULAR EXPRESSION SEARCH;

PIPELINE PROCESSING SYSTEMS;

EID: 35048813083     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27812-2_11     Document Type: Article

References (22)

1. Brüggemann-Klein, A., Regular expressions into finite automata, Theoret. Comput. Sci. 120 (1993) 197-213.
2. Champarnaud, J.-M., and F. Coulon, NFA reduction algorithms by means of regular inequalities, in: Z. Ésik, Z. Fülöp, eds., Proc. of DLT 2003 (Szeged, 2003), Lecture Notes in Comput. Sci. 2710, Springer-Verlag, Berlin, Heidelberg, 2003, 194-205.
3. Glushkov, V.M., The abstract theory of automata, Russian Math. Surveys 16 (1961) 1-53.
4. 2(n)) time, Theor. Inform. Appl. 34 (4) (2000) 257-277.
5. Hopcroft, J., An n log n algorithm for minimizing states in a finite automaton, Proc. Internat. Sympos. Theory of machines and computations, Technion, Haifa, 1971, Academic Press, New York, 1971, 189-196.
6. Hopcroft, J.E., and Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
7. Hromkovic, J., Seibert, S., and Wilke, T., Translating regular expressions into small ε-free nondeterministic finite automata, J. Comput. System Sci. 62 (4) (2001) 565 -588.
8. Ilie, L., and Yu, S., Algorithms for computing small NFAs, in: K. Diks, W. Rytter, eds., Proc. of the 27th MFCS, (Warszawa, 2002), Lecture Notes in Comput. Sci., 2420, Springer-Verlag, Berlin, Heidelberg, 2002, 328-340.
9. Ilie, L., and Yu, S., Reducing NFAs by invariant equivalences, Theoret. Comput. Sci. 306 (2003) 373-390.
10. Jiang, T., and Ravikumar, B., Minimal NFA problems are hard, SIAM J. Comput. 22(6) (1993), 1117-1141.
11. Kameda, T., and Weiner, P., On the state minimization of nondeterministic finite automata, IEEE Trans. Computers C-19(7) (1970) 617-627.
12. McNaughton, R., and Yamada, H., Regular expressions and state graphs for automata, IEEE Trans. on Electronic Computers 9 (1) (1960) 39-47.
13. Melnikov, B. F., A new algorithm of the state-minimization for the nondeterministic finite automata, Korean J. Comput. Appl. Math. 6(2) (1999) 277-290.
14. Melnikov, B. F., Once more about the state-minimization of the nondeterministic finite automata, Korean J. Comput. Appl. Math. 7(3) (2000) 655-662.
15. Navarro, G., NR-grep: a Fast and Flexible Pattern Matching Tool, Software Practice and Experience 31 (2001) 1265-1312.
16. Navarro, G., and Raffinot, M., Fast Regular Expression Search, Proc. WAE'99, Lecture Notes Comput. Sci. 1668, Springer-Verlag, Berlin, Heidelberg, 1999, 198 -212.
17. Navarro, G., and Raffinot, M., Compact DFA Representation for Fast Regular Expression Search, Proc. WAE'01, Lecture Notes Comput. Sci. 2141, Springer-Verlag, Berlin, Heidelberg, 2001, 1-12.
18. Navarro, G., and Raffinot, M., Flexible Pattern Matching in Strings. Practical OnLine Search Algorithms for Texts and Biological Sequences, Cambridge University Press, Cambridge, 2002.
19. Paige, R., and Tarjan, R.E, Three Partition Refinement Algorithms, SIAM J. Comput. (1987) 16(6) 973-989.
20. Thompson, K., Regular expression search algorithm, Comm. ACM 11 (6) (1968) 419-422.
21. Wu, S., and Mamber, U., Fast text searching allowing errors, Comm. ACM 35(10) (1992) 83-91.
22. Yu, S., Regular Languages, in: G. Rozenberg, A. Salomaa, Handbook of Formal Languages, Vol. I, Springer-Verlag, Berlin, 1997, 41-110.