Finding regular insertion encodings for permutation classes
Combinatorics
2009-11-16 v1
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.
Keywords
Cite
@article{arxiv.0911.2683,
title = {Finding regular insertion encodings for permutation classes},
author = {Vincent Vatter},
journal= {arXiv preprint arXiv:0911.2683},
year = {2009}
}