Finite Orbits of Language Operations

Final draft
lata2011_submission_58.pdf - 192.31 KB
Lataukset24

Verkkojulkaisu

DOI

Tiivistelmä

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.

item.page.okmtext