Computer Science – Formal Languages and Automata Theory
Scientific paper
2012-03-23
Computer Science
Formal Languages and Automata Theory
Scientific paper
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.
Jiraskova Galina
Shallit Jeffrey
No associations
LandOfFree
The state complexity of star-complement-star does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The state complexity of star-complement-star, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The state complexity of star-complement-star will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-38736