论文信息 - On the State Complexity of Star of Union and Star of Intersection

On the State Complexity of Star of Union and Star of Intersection

The state complexity of the star of union of an m-state DFA language and an n-state DFA language is proved to be 2 m+n−1−2 m−1−2 n−1+1 for every alphabet of at least two letters. The state complexity of the star of intersection is established as 3/4 2 mn for every alphabet of six or more letters. This improves the recent results of A. Salomaa, K. Salomaa and Yu (“State complexity of combined operations”, Theoret. Comput. Sci., 383 (2007) 140-152).

Alexander Okhotin | Galina Jirásková | A. Okhotin | Galina Jirásková

[1] Carlos Martín-Vide,et al. State Complexity of Basic Operations Combined with Reversal , 2007, LATA.

[2] Yuan Gao,et al. The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal , 2008, Fundam. Informaticae.

[3] Sheng Yu,et al. The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[4] Carlos Martín-Vide,et al. State complexity of basic language operations combined with reversal , 2008, Inf. Comput..

[5] Arto Salomaa,et al. State complexity of combined operations , 2007, Theor. Comput. Sci..

[6] Sheng Yu,et al. Tight Lower Bound for the State Complexity of Shuffle of Regular Languages , 2002, J. Autom. Lang. Comb..

[7] Michael Domaratzki,et al. State complexity of power , 2009, Theor. Comput. Sci..

[8] Galina Jirásková,et al. State complexity of some operations on binary regular languages , 2005, Theor. Comput. Sci..

[9] Alexander Okhotin,et al. State complexity of cyclic shift , 2008, RAIRO Theor. Informatics Appl..