State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal
- Cite this paper as:
- Gao Y., Yu S. (2011) State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg
In this paper, we study the state complexities of union and intersection combined with star and reversal, respectively. We obtain the exact bounds for these combined operations on regular languages and show that, as usually, they are different from the mathematical compositions of the state complexities of their individual participating operations.
Unable to display preview. Download preview PDF.