Minimizing nfa's and regular expressions

Journal of Computer and System Sciences

Volumn 73, Issue 6, 2007, Pages 908-923

  Gramlich, Gregor ^a   Schnitger, Georg ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Approximability; Automata and formal languages; Computational complexity

Indexed keywords

APPROXIMATION THEORY; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; FORMAL LANGUAGES; OPTIMIZATION;

APPROXIMATION FACTORS; REGULAR EXPRESSIONS;

FINITE AUTOMATA;

EID: 34250157750     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.11.002     Document Type: Article

References (16)

1. Champarnaud J.-M., and Coulon F. Nfa reduction algorithms by means of regular inequalities. Theoret. Comput. Sci. 327 3 (2004) 241-253
2. Domaratzki M., Kisman D., and Shallit J. On the number of distinct languages accepted by finite automata with n states. J. Automata Languages Combinatorics 7 4 (2002) 469-486
3. Gramlich G. Probabilistic and nondeterministic unary automata. In: Rovan B., and Vojtás P. (Eds). MFCS. Lecture Notes in Comput. Sci. vol. 2747 (2003), Springer-Verlag 460-469
4. Gramlich G., and Schnitger G. Minimizing nfa's and regular expressions. In: Diekert V., and Durand B. (Eds). STACS '05. Lecture Notes in Comput. Sci. vol. 3404 (2005), Springer-Verlag
5. Ilie L., Navarro G., and Yu S. On nfa reductions. In: Karhumäki J., Maurer H.A., Paun G., and Rozenberg G. (Eds). Theory Is Forever. Lecture Notes in Comput. Sci. vol. 3113 (2004), Springer-Verlag 112-124
6. Ilie L., and Yu S. Follow automata. Inform. and Comput. 186 1 (2003) 140-162
7. Jiang T., McDowell E., and Ravikumar B. The structure and complexity of minimal nfa's over a unary alphabet. Int. J. Found. Comput. Sci. 2 2 (1991) 163-182
8. Jiang T., and Ravikumar B. Minimal nfa problems are hard. SIAM J. Comput. 22 6 (1993) 1117-1141
9. Kearns M.J., and Valiant L.G. Cryptographic limitations on learning boolean formulae and finite automata. J. ACM 41 1 (1994) 67-95
10. Matz O., and Potthoff A. Computing small nondeterministic finite automata. Proc. of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems (1995), Dpt. of CS., Univ. of Aarhus 74-88
11. A.R. Meyer, L.J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, in: Proc. 13th Ann. IEEE Symp. on Switching and Automata Theory, 1972, pp. 125-129
12. Naor M., and Reingold O. Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51 2 (2004) 231-262
13. Pitt L., and Warmuth M.K. Prediction-preserving reducibility. J. Comput. System Sci. 41 3 (1990) 430-467
14. Pitt L., and Warmuth M.K. The minimum consistent dfa problem cannot be approximated within any polynomial. J. ACM 40 1 (1993) 95-142
15. Razborov A.A., and Rudich S. Natural proofs. J. Comput. System Sci. 55 1 (1997) 24-35
16. L.J. Stockmeyer, A.R. Meyer, Word problems requiring exponential time: Preliminary report, in: Proc. of the 5th Annual ACM Symposium on Theory of Computing, 1973, pp. 1-9