State complexity of union and intersection combined with star and reversal
classification
💻 cs.FL
keywords
statecombinedcomplexitiesintersectionoperationsreversalstarunion
read the original abstract
In this paper, we study the state complexities of union and intersection combined with star and reversal, respectively. We obtain the state complexities of these combined operations on regular languages and show that they are less than the mathematical composition of the state complexities of their individual participating operations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.