AB - © Springer International Publishing AG, part of Springer Nature 2018. We prove that the set of permutations sorted by a stack of depth t ? 3 and an infinite stack in series has infinite basis, by constructing an infinite antichain. This answers an open question on identifying the point at which, in a sorting process with two stacks in series, the basis changes from finite to infinite.
AU - Elder, M
AU - Goh, YK
DA - 2018/01/01
DO - 10.1007/978-3-319-77313-1_17
EP - 231
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PY - 2018/01/01
SP - 220
TI - Permutations Sorted by a Finite and an infinite stack in series
VL - 10792 LNCS
Y1 - 2018/01/01
Y2 - 2019/09/18
ER -