The state complexity of star-complement-star

Authors:
Galina Jirásková;Jeffrey Shallit
Affiliations:
Mathematical Institute, Slovak Academy of Sciences, Košice, Slovakia;School of Computer Science, University of Waterloo, Waterloo, ON, Canada
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 5
Cited 1

The state complexities of some basic operations on regular languages

Theoretical Computer Science
Regular languages

Handbook of formal languages, vol. 1
Introduction to the Theory of Computation

Introduction to the Theory of Computation
State complexity of combined operations

Theoretical Computer Science
Finite automata and their decision problems

IBM Journal of Research and Development

On the boundary of regular languages

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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 $\left( \, \overline{L^*} \, \right)^*$.