Reducing the size of NFAs by using equivalences and preorders

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 310-321

  Ilie, Lucian ^a   Solis Oba, Roberto ^a   Yu, Sheng ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Equivalences; Finite automata; Preorders; Regular expression matching; State complexity

Indexed keywords

AUTOMATION; COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; FORMAL LANGUAGES; PROBLEM SOLVING;

EQUIVALENCES; PREORDERS; REGULAR EXPRESSION MATCHING; STATE COMPLEXITY;

FINITE AUTOMATA;

EID: 26444573200     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_27     Document Type: Conference Paper

References (21)

1. Bar-Yehuda, R., and Even, S., A linear-time approximation algorithm for the weighted vertex cover problem, Journal of Algorithms 2, 1981, 198-203.
2. Champarnaud, J.-M., and Coulon, F., 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. Champarnaud, J.-M., and Coulon, F., NFA reduction algorithms by means of regular inequalities, Theoret. Comput. Sci. 327(3) 241-253.
4. Champarnaud, J.-M., and Coulon, F., NFA reduction algorithms by means of regular inequalities - correction, Theoret. Comput. Sci., to appear.
5. Garey M.R. and Johnson D.S., Computers and intractability: a guide to the theory of NP-completeness, W.H. Freeman and Company, New York, 1979.
6. 2(n)) time, Theor. Inform. Appl. 34 (4) (2000) 257-277.
7. 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.
8. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM Journal on Computing, bf 2(4) (1973), 225-231.
9. Hopcroft, J.E., and Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
10. 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.
11. ILie, L., Navarro, G., and Yu, S., On NFA reductions, in: J. Karhumaki, H. Maurer, G. Paun, G. Rozenberg, eds., Theory is Forever (Salomaa Festschrift), Lecture Notes in Comput. Sci. 3113, Springer-Verlag, Berlin, Heidelberg, 2004, 112-124.
12. 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.
13. Ilie, L., and Yu, S., Reducing NFAs by invariant equivalences, Theoret. Comput. Sci. 306 (2003) 373-390.
14. Jiang, T., and Ravikumar, B., Minimal NFA problems are hard, SIAM J. Comput. 22(6) (1993), 1117-1141.
15. Kameda, T., and Weiner, P., On the state minimization of nondeterministic finite automata, IEEE Trans. Computers C-19(7) (1970) 617-627.
16. 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.
17. Melnikov, B. F., Once more about the state-minimization of the nondeterministic finite automata, Korean J. Comput. Appl. Math. 7(3) (2000) 655-662.
18. 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.
19. Navarro, G., and Raffinot, M., Flexible Pattern Matching in Strings. Practical On-Line Search Algorithms for Texts and Biological Sequences, Cambridge University Press, Cambridge, 2002.
20. Paige, R., and Tarjan, R.E, Three Partition Refinement Algorithms, SIAM J. Comput. (1987) 16(6) 973-989.
21. Yu, S., Regular Languages, in: G. Rozenberg, A. Salomaa, Handbook of Formal Languages, Vol. I, Springer-Verlag, Berlin, 1997, 41-110.