Lower bounds for the transition complexity of NFAs

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

Volumn 4162 LNCS, Issue , 2006, Pages 315-326

  Domaratzki, Michael ^a   Salomaa, Kai ^b  

^a ACADIA UNIVERSITY   (Canada)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; FORMAL LANGUAGES; NUMBER THEORY;

LOWER BOUNDS; NFA RECOGNIZING; STATE COMPLEXITY; TRANSITION COMPLEXITY;

BOUNDARY CONDITIONS;

EID: 33750064245     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_28     Document Type: Conference Paper

References (22)

1. Anderson, I.: Combinatorial Designs, Construction Methods. John Wiley (1990)
2. Cameron, P.J.: Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press (1996)
3. Domaratzki, M., Salomaa, K.: Lower bounds for the transition complexity of NFAs. Queen's School of Computing Technical Report No. 2006-515. Available at www.cs.queensu.ca/TechReports
4. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Proc. Lett. 59 (1996) 75-77
5. Goldstine, J., Kappes, M., Kintala, C.M.R, Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. Universal Comput. Sci. 8 (2002) 193-234
6. Gramlich, G., Schnitger, G.: Minimizing NFA's and regular expressions. In: Proc. STAGS 2005. Lect. Notes Comput. Sci., Vol. 3404. Springer-Verlag (2005) 399-411
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" (2005) 24-25
8. Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard. In: Ibarra, O.H., Dang, Z. (eds.): Proceedings DLT 2006. Lect. Notes Comput. Sci., Vol. 4036. Springer-Verlag (2006)
9. Gruber, H., Holzer, M.: Results on the average state complexity of finite automata accepting finite languages. In: Proc. of Descriptional Complexity of Formal Systems, DCFS 2006, to appear
10. Holzer, M., Kutrib, M.: Unary language operations and their nondeterministic state complexity. In: Proc. DLT 2002. Lect. Notes Comput. Sci., Vol. 2450. Springer-Verlag (2003) 162-172
11. Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Internat. J. Foundations of Computer Science 14 (2003) 1087-1102
12. Hromkovič, J.: Communication Complexity and Parallel Computing. Springer-Verlag (1997)
13. Hromkovič, J.: Descriptional complexity of finite automata: Concepts and open problems. J. Automata, Languages and Combinatorics 7 (2002) 519-531
14. Hromkovič, J., Schnitger, G.: NFAs with and without e-transitions. Proc. ICALP 2005. Lect. Notes Comput. Sci., Vol. 3580. Springer-Verlag (2005) 385-396
15. Hromkovič, J., Seibert, S., Wilke, T.: Translating regular expressions in small ε-free nondeterministic finite automata. J. Comput. System Sci. 62 (2001) 565-588
16. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22 (1993) 1117-1141
17. Jukna, S.: Extremal Combinatorics with Applications in Computer Science. EATCS Texts in Theoretical Computer Science, Springer-Verlag (2001)
18. Kari, J.: Personal communication, April 2006
19. Lifshits, Yu.: A lower bound on the size of ε-free NFA corresponding to a regular expression. Inform. Proc. Lett. 85 (2003) 293-299
20. Malcher, A.: Minimizing finite automata is computationally hard. Theoret. Comput. Sci. 327 (2004) 375-390
21. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds): Handbook of Formal Languages, Vol. I. Springer-Verlag (1997) 41-110
22. Yu, S.: State complexity of finite and infinite regular languages. Bulletin of the EATCS 76 (2002) 142-152