State complexity of union and intersection of star on k regular languages

In this paper, we continue our study on state complexity of combined operations. We study the state complexities of , , , and for regular languages Li, 1≤i≤k. We obtain the exact bounds for these combined operations and show that the bounds are different from the mathematical compositions of the state complexities of their component individual operations.