Finite Orbits of Language Operations
classification
💻 cs.FL
keywords
closurefinitelanguageoperationsboundedcomplementconsidergeneralizes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.