Abstract
In this paper, we continue our study on state complexity of combined operations. We study the state complexities of L1∗∪L2∗, ⋃i=1kLi∗, L1∗∩L2∗, and ⋂i=1kLi∗ 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.
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.
