Abstract
This paper studies the state complexity of (L1L2)R, L1RL2, L1∗L2, (L1∪L2)L3, (L1∩L2)L3, L1L2∩L3, and L1L2∪L3 for regular languages L1, L2, and L3. We first show that the upper bound proposed by Liu et al. (2008) [18] for the state complexity of (L1L2)R coincides with the lower bound and is thus the state complexity of this combined operation by providing some witness DFAs. Also, we show that, unlike most other cases, due to the structural properties of the result of the first operation of the combinations L1RL2, L1∗L2, and (L1∪L2)L3, the state complexity of each of these combined operations is close to the mathematical composition of the state complexities of the component operations. Moreover, we show that the state complexities of (L1∩L2)L3, L1L2∩L3, and L1L2∪L3 are exactly equal to the mathematical compositions of the state complexities of their component operations in the general cases. We also include a brief survey that summarizes all state complexity results for combined operations with two basic operations.
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.
