Transition complexity of language operations

Theoretical Computer Science

Volumn 387, Issue 2, 2007, Pages 147-154

  Domaratzki, Michael ^a   Salomaa, Kai ^b  

^a UNIVERSITY OF MANITOBA   (Canada)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

Descriptional complexity; Nondeterministic finite automata; Regular languages; Transition complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; MATHEMATICAL MODELS;

DESCRIPTIONAL COMPLEXITY MEASURES; NONDETERMINISTIC FINITE AUTOMATON (NFA); REGULAR LANGUAGE OPERATIONS; TRANSITION COMPLEXITY OF LANGUAGES;

FORMAL LANGUAGES;

EID: 35348880279     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.034     Document Type: Article

References (19)

1. Yu S. State complexity of the regular languages. J. Autom. Lang. Comb. 6 (2001) 221-234
2. Yu S. State complexity of finite and infinite regular languages. Bull. Eur. Assoc. Theor. Comput. Sci. 76 (2002) 142-152
3. K. Ellul, Descriptional complexity measures of regular languages, Master's Thesis, University of Waterloo, 2002
4. Holzer M., and Kutrib M. Unary language operations and their nondeterministic state complexity. Developments in Language Theory, Sixth International Conference. LNCS vol. 2450 (2002), Springer 162-172
5. Holzer M., and Kutrib M. Nondeterministic descriptional complexity of regular languages. Internat. J. Found. Comput. Sci. 14 (2003) 1087-1102
6. Ellul K., Krawetz B., Shallit J., and Wang M.-W. Regular expressions: New results and open problems. J. Autom. Lang. Comb. 9 2-3 (2004) 233-256
7. Domaratzki M., Ellul K., Shallit J., and Wang M.-W. Non-uniqueness and radius of cyclic unary NFAs. Internat. J. Found. Comput. Sci. 16 5 (2005) 883-896
8. Geffert V. Translation of binary regular expressions into nondeterministic ε{lunate}-free automata with O (n log n) transitions. J. Comput. System Sci. 66 (2003) 451-472
9. Hromkovič J. Descriptional complexity of finite automata: Concepts and open problems. J. Autom. Lang. Comb. 7 (2002) 519-531
10. Hromkovič J., and Schnitger G. NFAs with and without ε{lunate}-transitions. Proceedings of ICALP. LNCS vol. 3580 (2005), Springer 385-396
11. Hromkovič J., Seibert S., and Wilke T. Translating regular expressions in small ε{lunate}-free nondeterministic finite automata. J. Comput. System Sci. 62 (2001) 565-588
12. Lifshits Y. A lower bound on the size of ε{lunate}-free NFA corresponding to a regular expression. Inform. Process. Lett. 85 (2003) 293-299
13. Schnitger G. Regular expressions and NFAs without ε{lunate}-transitions. Proceedings of STACS. LNCS vol. 3884 (2006), Springer 432-443
14. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages (1997), Springer
15. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley
16. Jirásková G. State complexity of some operations on regular languages. Theoret. Comput. Sci. 330 2 (2005) 287-298
17. Mera F., and Pighizzini G. Complementing unary nondeterministic automata. Theoret. Comput. Sci. 330 2 (2005) 349-360
18. Hromkovic ̌ J. Communication Complexity and Parallel Computing (1997), Springer
19. Glaister I., and Shallit J. A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59 (1996) 75-77