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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
APA
Charlier, É., Domaratzki, M., Harju, T., & Shallit, J. (2011). Finite orbits of language operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 204–215). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free