Abstract
We examine the deterministic and nondeterministic state complexity of complements, stars, and reversals of regular languages. Our results are as follows: (1) The nondeterministic state complexity of the complement of an n-state nfa language over a five-letter alphabet may reach each value from log n to 2n. (2) The state complexity of the star (reversal) of an n-state dfa language over a growing alphabet may reach each value from 1 to [Formula: see text] (from log n to 2n, respectively). (3) The nondeterministic state complexity of the star (reversal) of an n-state nfa binary language may reach each value from 1 to n + 1 (from n - 1 to n + 1, respectively). We also obtain some partial results on the nondeterministic state complexity of complements of binary regular languages. As a bonus, we get an exponential number of values that are non-magic in the binary case.
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: 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.
