Finite Orbits of Language Operations
Formal Languages and Automata Theory
2011-03-02 v2
Abstract
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.
Cite
@article{arxiv.1101.1667,
title = {Finite Orbits of Language Operations},
author = {E. Charlier and M. Domaratzki and T. Harju and J. Shallit},
journal= {arXiv preprint arXiv:1101.1667},
year = {2011}
}