Abstract
We study the nondeterministic state complexity of basic regular operations on the classes of prefix-, suffix-, factor-, and subword-free, -closed, and -convex regular languages and on the classes of right, left, two-sided, and all-sided ideal regular languages. For the operations of concatenation, intersection, union, reversal, star, and complementation, we get tight upper bounds for all considered classes except for complementation on factor- and subword-convex languages. Most of our witnesses are described over optimal alphabets. The description of a proper suffix-convex language over a five-letter alphabet meeting the upper bound 2n for complementation, and obtaining an asymptotically tight bound Θ(n) for complementation of unary prefix-free languages are among the most interesting results of this paper.
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.
