State Complexity and the Monoid of Transformations of a Finite Set

Details State Complexity and the Monoid of Transformations of a Finite Set State Complexity and the Monoid of Transformations of a Finite Set

2003-06-29

arxiv.org/abs/math/0306416v2

Mathematics

Group Theory

Added discussion of prior work. Generalized results to both even and odd cases. Corrected mistakes

Scientific paper

In this paper we consider the state complexity of an operation on formal
languages, root(L). This naturally entails the discussion of the monoid of
transformations of a finite set. We obtain good upper and lower bounds on the
state complexity of root(L) over alphabets of all sizes.

Affiliated with

Also associated with

No associations

Rating

State Complexity and the Monoid of Transformations of a Finite Set 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 State Complexity and the Monoid of Transformations of a Finite Set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State Complexity and the Monoid of Transformations of a Finite Set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32228