Finding regular insertion encodings for permutation classes
classification
🧮 math.CO
keywords
insertionalgorithmclassesencodingpermutationregularacceptingaccompanying
read the original abstract
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.
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.