The state complexity of star-complement-star
classification
💻 cs.FL
keywords
complexitystateasymptoticboundscomplementdenotesdetermininglanguage
read the original abstract
We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (c(L*))*, where c() denotes complement.
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.