scientific article; zbMATH DE number 3492580
From MaRDI portal
Publication:4074820
zbMATH Open0314.94030MaRDI QIDQ4074820FDOQ4074820
Authors: Vaughan R. Pratt 
Publication date: 1973
Title of this publication is not available (Why is that?)
General topics in the theory of software (68N01) Formal languages and automata (68Q45) Programming involving graphs or networks (90C35) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)
Cited In (34)
- Sorting with a popqueue
- Passing through a stack \(k\) times with reversals
- Regular closed sets of permutations.
- An exact characterization of saturation for permutation matrices
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
- Restricted permutations
- Inflations of geometric grid classes of permutations
- Generating permutations with restricted containers
- The enumeration of permutations sortable by pop stacks in parallel
- Sorting twice through a stack
- Sorting via shuffles with a cut after the longest increasing prefix
- Pattern matching for permutations
- Pattern matching for permutations
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- Permutations of a multiset avoiding permutations of length 3
- Sorting with networks of data structures
- An infinite antichain of planar tanglegrams
- Labelled well-quasi-order for permutation classes
- Passing through a stack k times
- Operators of equivalent sorting power and related Wilf-equivalences
- Permutations sortable by deques and by two stacks in parallel
- Finding and counting permutations via CSPs
- Permutations sortable by two stacks in parallel and quarter plane walks
- On the least exponential growth admitting uncountably many closed permutation classes
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- Signed enumeration of upper-right corners in path shuffles
- Stieltjes moment sequences for pattern-avoiding permutations
- Permutations generated by token passing in graphs
- Priority queues with binary priorities
- Sorting by shuffling methods and a queue
- An antichain of monomial ideals in a twisted commutative algebra
- Deque automata, languages, and planar graph representations
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Two-stack-sorting with pop stacks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074820)
