5th International Conference on Language and Automata Theory and Applications
du 26 mai 2011 au 31 mai 2011
[en] formal language ; orbit ; Kleene closure ; complement
[en] 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.