The tractability frontier for NFA minimization

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

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 27-38

  Björklund, Henrik ^a   Martens, Wim ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC FINITE AUTOMATA; FINITE LANGUAGES; NP-HARD;

AUTOMATA THEORY; LINGUISTICS; NUCLEAR PROPULSION; ROBOTS; TRANSLATION (LANGUAGES);

FINITE AUTOMATA;

EID: 49049121424     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_3     Document Type: Conference Paper

References (18)

1. Abdulla, P., Deneux, J., Kaati, L., Nilsson, M.: Minimization of non-deterministic automata with large alphabets. In: CIAA, pp. 31-42 (2006)
2. Goldstine, J., Kappes, M., Kintala, C., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. Univ. Comp. Science 8(2), 193-234 (2002)
3. Gramlich, G., Schnitger, G.: Minimizing NFAs and regular expressions. JCSS 73(6), 908-923 (2007)
4. Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 363-374. Springer, Heidelberg (2006)
5. Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: LATA, pp. 261-272 (2007)
6. Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP. In:Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 205-216. Springer, Heidelberg (2007)
7. Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. J. Automata, Languages, and Combinatorics 6(4), 453-466 (2001)
8. Hromkovic, J., Karhumäki, J., Klauck, H., Schnitger, G., Seibert, S.: Measures of nondeterminism in finite automata. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 199-210. Springer, Heidelberg (2000)
9. Hromkovic, J., Schnitger, G.: Comparing the size of NFAs with and without epsilon-transitions. TCS 380(2), 100-114 (2007)
10. Jiang, T., McDowell, E., Ravikumar, B.: The structure and complexity of minimal NFAs over unary alphabet. Int. J. Found. Comp. Science 2, 163-182 (1991)
11. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. Siam J. Comp. 22(6), 1117-1141 (1993)
12. Malcher, A.: Minimizing finite automata is computationally hard. TCS 327(3), 375-390 (2004)
13. Meyer, A., Fischer, M.J.: Economy of descriptions by automata, grammars, and formal systems. In: FOCS, pp. 188-191. IEEE, Los Alamitos (1971)
14. Paige, R., Tarjan, R.: Three parition refinement algorithms. Siam J. Comp. 16, 973-989 (1987)
15. Salomaa, K.: Descriptional complexity of nondeterministic finite automata. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 31-35. Springer, Heidelberg (2007)
16. Schnitger, G.: Regular expressions and NFAs without epsilon-transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 432-443. Springer, Heidelberg (2006)
17. Stearns, R.E., Hunt III., H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. Siam J. Comp. 14(3), 598-611 (1985)
18. Stockmeyer, L., Meyer, A.:Word problems requiring exponential time: Preliminary report. In: STOC, pp. 1-9. ACM, New York (1973)