The enumeration of permutations sortable by pop stacks in parallel

被引：6
|
作者：
Smith, Rebecca [2 ]
Vatter, Vincent [1 ]
机构：
[1] Dartmouth Coll, Dept Math, Hanover, NH 03755 USA
[2] SUNY Coll Brockport, Dept Math, Brockport, NY 14420 USA
来源：
INFORMATION PROCESSING LETTERS | 2009年 / 109卷 / 12期
关键词：
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.
引用
收藏
页码：626 / 629
页数：4
相关论文
共 50 条
12345