| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401468 | Journal of Symbolic Computation | 2012 | 7 Pages |
Abstract
We describe a practical algorithm which computes the accepting automaton for the insertion encoding of a permutation class, whenever this insertion encoding forms a regular language. This algorithm is implemented in the accompanying Maple package InsEnc, which can automatically compute the rational generating functions for such classes.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
