Finite Orbits of Language Operations

Details Finite Orbits of Language Operations Finite Orbits of Language Operations

2011-01-09

arxiv.org/abs/1101.1667v2

Computer Science

Formal Languages and Automata Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Finite Orbits of Language Operations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite Orbits of Language Operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite Orbits of Language Operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-266229