Algorithms;
Data structures;
Insertion encoding;
Permutation;
Pop stack;
Sorting;
D O I:
10.1016/j.ipl.2009.02.014
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
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. (c) 2009 Elsevier B.V. All rights reserved.