Add to ORKGWe prove that the class of permutations generated by passing an ordered sequence 12...n through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length n is encoded by a string of length 3n. It follows that the sequence counting the number of permutations of each length has an algebraic generating function
Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ≥ 1)...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
We investigate a generalization of stacks that we call - machines. We show how this viewpoint rapidl...
© 2015, Australian National University. All rights reserved. We prove that the class of permutations...
We prove that the set of permutations generated by a stack of depth two and an infinite stack in ser...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
© Springer International Publishing AG, part of Springer Nature 2018. We prove that the set of permu...
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into ele...
AbstractA simple permutation is one that never maps a nontrivial contiguous set of indices contiguou...
A simple permutation is one that never maps a nontrivial contiguous set of indices contiguously. Giv...
We consider the naive bottom-up concatenation scheme for a context- free language and show that this...
Lower and upper bounds are given for the the number of permutations of length n generated by two sta...
In this thesis we investigate some interesting properties of the family of permutation languages and...
The signature of a permutation $\sigma$ is a word whose letter of index i is d when $sigma$ has a de...
We show that the counting sequence for permutations avoiding both of the(classical) patterns 1243 an...
Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ≥ 1)...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
We investigate a generalization of stacks that we call - machines. We show how this viewpoint rapidl...
© 2015, Australian National University. All rights reserved. We prove that the class of permutations...
We prove that the set of permutations generated by a stack of depth two and an infinite stack in ser...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
© Springer International Publishing AG, part of Springer Nature 2018. We prove that the set of permu...
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into ele...
AbstractA simple permutation is one that never maps a nontrivial contiguous set of indices contiguou...
A simple permutation is one that never maps a nontrivial contiguous set of indices contiguously. Giv...
We consider the naive bottom-up concatenation scheme for a context- free language and show that this...
Lower and upper bounds are given for the the number of permutations of length n generated by two sta...
In this thesis we investigate some interesting properties of the family of permutation languages and...
The signature of a permutation $\sigma$ is a word whose letter of index i is d when $sigma$ has a de...
We show that the counting sequence for permutations avoiding both of the(classical) patterns 1243 an...
Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ≥ 1)...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
We investigate a generalization of stacks that we call - machines. We show how this viewpoint rapidl...