%0 Journal Article
%T Finite Orbits of Language Operations
%A E. Charlier
%A M. Domaratzki
%A T. Harju
%A J. Shallit
%J Computer Science
%D 2011
%I arXiv
%X We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. This generalizes previous results about complement, Kleene closure, and positive closure.
%U http://arxiv.org/abs/1101.1667v2