| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428138 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We show that the set of permutations sortable by k pop stacks in parallel has a regular insertion encoding and construct the (finite) recognizing automaton for this language. This shows that these permutations have a rational generating function, verifying a conjecture of Atkinson and Sack.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
