State complexity of combined operations

Theoretical Computer Science

Volumn 383, Issue 2-3, 2007, Pages 140-152

  Salomaa, Arto ^a   Salomaa, Kai ^b   Yu, Sheng ^c  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b QUEEN S UNIVERSITY   (Canada)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Combined operations; Regular languages; State complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY;

COMBINED OPERATIONS; PARTICIPATING OPERATIONS; STATE COMPLEXITY;

FORMAL LANGUAGES;

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

References (22)

1. Birget J.-C. Partial orders on words, minimal elements of regular languages, and state complexity. Theoretical Computer Science 119 (1993) 267-291
2. Campeanu C., Culik K., Salomaa K., and Yu S. State complexity of basic operations on finite languages. Proceedings of the Fourth International Workshop on Implementing Automata VIII 1-11. LNCS vol. 2214 (1999) 60-70
3. Campeanu C., Salomaa K., and Yu S. Tight lower bound for the state complexity of shuffle of regular languages. Journal of Automata, Languages and Combinatorics 7 3 (2002) 303-310
4. Campeanu C., Salomaa K., and Yu S. Chapter 5: state complexity of regular languages: finite versus infinite. In: Calude C., and Paun G. (Eds). Finite vs Infinite - Contributions to an Eternal Dilemma (2000), Springer 53-73
5. Domaratzki M. State complexity and proportional removals. Journal of Automata, Languages and Combinatorics 7 (2002) 455-468
6. Holzer M., and Kutrib M. State complexity of basic operations on nondeterministic finite automata. Proceedings of International Conference on Implementation and Application of Automata 2002, CIAA 2002. LNCS vol. 2608 (2002), Springer 148-157
7. Holzer M., and Kutrib M. Unary language operations and their nondeterministic state complexity. Developments in Language Theory, DLT 2002. LNCS vol. 2450 (2002), Springer 162-172
8. Holzer M., Salomaa K., and Yu S. On the state complexity of k-entry deterministic finite automata. Journal of Automata, Languages and Combinatorics 6 4 (2001) 453-466
9. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison Wesley, Reading, Mass
10. Iwama K., Kambayashi Y., and Takaki K. Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. Theoretical Computer Science 237 (2000) 485-494
11. G. Jirásková, State complexity of some operations on regular languages, in: Proceedings of 5th Workshop on Descriptional Complexity of Formal Systems, 2003, pp. 114-125
12. Jirásková G. State complexity of some operations on binary regular languages. Theoretical Computer Science 330 (2005) 287-298
13. Jirásek J., Jirásková G., and Szabari A. State complexity of concatenation and complementation of regular languages. International Journal of Foundations of Computer Science 16 (2005) 511-529
14. G. Jirásková, A. Okhotin, State complexity of cyclic shift, in: Proceedings of DCFS 2005, Como, Italy, June 30-July 2, 2005, pp. 182-193
15. Nicaud C. Average State Complexity of Operations on Unary Automata. MFCS'99. LNCS vol. 1672 (1999) 231-240
16. Pighizzini G., and Shallit J. Unary language operations, state complexity and Jacobsthal's function. International Journal of Foundations of Computer Science 13 1 (2002) 145-159
17. Salomaa A. Theory of Automata (1969), Pergamon Press, Oxford
18. Salomaa A., Wood D., and Yu S. On the state complexity of reversals of regular languages. Theoretical Computer Science 320 (2004) 293-313
19. Salomaa K., and Yu S. NFA to DFA transformation for finite languages over arbitrary alphabets. Journal of Automata, Languages and Combinatorics 2 3 (1997) 177-186
20. Yu S. State complexity of regular languages. Journal of Automata, Languages and Combinatorics 6 2 (2001) 221-234
21. Yu S., Zhuang Q., and Salomaa K. The state complexities of some basic operations on regular languages. Theoretical Computer Science 125 (1994) 315-328
22. Yu S. Regular languages. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages, Vol. 1 (1997), Springer-Verlag 41-110