Finding regular insertion encodings for permutation classes

Details Finding regular insertion encodings for permutation classes Finding regular insertion encodings for permutation classes

2009-11-13

arxiv.org/abs/0911.2683v1

Mathematics

Combinatorics

Scientific paper

We describe a practical algorithm which computes the accepting automaton for
the insertion encoding of a permutation class, whenever this insertion encoding
is regular. This algorithm is implemented in the accompanying Maple package
INSENC, which can automatically compute the rational generating functions for
such classes.

Affiliated with

Also associated with

No associations

Rating

Finding regular insertion encodings for permutation classes 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 Finding regular insertion encodings for permutation classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding regular insertion encodings for permutation classes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-150197