Descriptional complexity of nondeterministic finite automata

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

Volumn 4588 LNCS, Issue , 2007, Pages 31-35

  Salomaa, Kai ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROBLEM SOLVING; STATE SPACE METHODS;

NONDETERMINISTIC FINITE AUTOMATA; TRANSITION COMPLEXITY;

FINITE AUTOMATA;

EID: 34548102216     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73208-2_6     Document Type: Conference Paper

References (22)

1. Birget, J.-C.: Partial orders on words, minimal elements of regular languages and state complexity. Theoret. Comput. Sci. 119, 267-291 (1993)
2. Domaratzki, M., Salomaa, K.: Transition complexity of language operations. In: Leung, H., Pighizzini, G. (eds.): Proc. of Descriptional Complexity of Formal Systems, DCFS 2006, Las Cruces, NM, pp. 141-152 (2006)
3. Domaratzki, M., Salomaa, K.: Lower bounds for the transition complexity of NFAs. In: Králović, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 315-326. Springer, Heidelberg (2006)
4. Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. Universal Computer Science 8, 193-234 (2002)
5. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inf. Proc. Letters 59, 75-77 (1996)
6. Gramlich, G., Schnitger, G.: Minimizing NFA's and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 399-411. Springer, Heidelberg (2005)
7. Gruber, H., Holzer, M.: A note on the number of transitions of nondeterministic finite automata. In: Fernau, H. (ed.) 15. Theorietag der GI-Fachgruppe 0.1.5 Automaten und Formale Sprachen, pp. 24-25 (2005)
8. Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 363-374. Springer, Heidelberg (2006)
9. Gruber, H., Holzer, M.: Results on the average state complexity of finite automata accepting finite languages. In: Leung, H., Pighizzini, G. (eds.) Proc. of Descriptional Complexity of Formal Systems, DCFS 2006, Las Cruces, NM, pp. 267-275 (2006)
10. Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: Proc. of 1st International Conference on Language Theory and Applications, LATA (2007)
11. Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P j¿ NP. In: Proc. of 11th International Conference Developments in Language Theory, DLT (2007)
12. Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Internat. J. Foundations of Computer Science 14, 1087-1102 (2003)
13. Hromković, J.: Communication Complexity and Parallel Computing. Springer, Heidelberg (1997)
14. Hromković, J.: Descriptional complexity of finite automata: Concepts and open problems. J. Automata, Languages and Combinatorics 7, 519-531 (2002)
15. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Computing 22, 1117-1141 (1993)
16. Kari, J.: Personal communication (2006)
17. Malcher, A.: Minimizing finite automata is computationally hard. Theoret. Comput. Sci. 327, 375-390 (2004)
18. Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theoret. Comput. Sci. (to appear)
19. Salomaa, K., Yu, S.: On the state complexity of combined operations and their estimation. Internat. J. Foundations of Computer Science (to appear)
20. Schnitger, G.: Regular expressions and NFAs without ε-transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 432-443. Springer, Heidelberg (2006)
21. Yu, S.: Grail+: A symbolic computation environment for finite-state machines, regular expressions and finite languages. (2002), http ://www.csd.uwo.ca/Research/grail
22. Yu, S.: State complexity of regular languages. J. Automata, Languages and Combinatorics 6, 221-234 (2001)