Abstract
In this paper, we continue our study on the state complexity of combined operations on regular languages. We study the state complexities of ⋃i=1kLi2, ⋂i=1kLi2, ⋃i=1kLiR, and ⋂i=1kLiR, for regular languages Li, 1≤i≤k, k≥2. We obtain the exact bounds for these combined operations and show that the state complexities of ⋃i=1kLi2 and ⋂i=1kLi2 are the same as the mathematical compositions of the state complexities of their component individual operations, while, on the other hand, the state complexities of ⋃i=1kLiR and ⋂i=1kLiR are lower than the corresponding mathematical compositions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
