Regular closed sets of permutations.

DOI10.1016/S0304-3975(03)00212-3zbMath1059.68055OpenAlexW2008070577MaRDI QIDQ1426439

M. D. Atkinson, Michael Henry Albert, Nikola Ruškuc

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00212-3

zbMATH Keywords

PermutationsInvolvementRegular sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

On pattern avoidance in matchings and involutions ⋮ On the least exponential growth admitting uncountably many closed permutation classes ⋮ Labelled well-quasi-order for permutation classes ⋮ Sorting by shuffling methods and a queue ⋮ Permutations generated by stacks and deques ⋮ Growing at a Perfect Speed ⋮ Generating permutations with restricted containers ⋮ Simple permutations: Decidability and unavoidable substructures ⋮ Reduced word manipulation: patterns and enumeration ⋮ Combinatorial specifications for juxtapositions of permutation classes ⋮ Geometric grid classes of permutations ⋮ Inflations of geometric grid classes of permutations ⋮ Permutations generated by a depth 2 stack and an infinite stack in series are algebraic ⋮ Permuting machines and priority queues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partially well-ordered closed sets of permutations
• Forbidden subsequences and Chebyshev polynomials
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations generated by token passing in graphs
• Generating trees and the Catalan and Schröder numbers
• Sorting Using Networks of Queues and Stacks
• Restricted permutations
• Restricted 132-avoiding permutations

This page was built for publication: Regular closed sets of permutations.