Regular closed sets of permutations.

DOI10.1016/S0304-3975(03)00212-3MaRDI QIDQ1426439zbMATH OpenOpenAlexFDO

Authors Mike Atkinson, Michael Albert, N. 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)

Recommendations

• Permuting machines and permutation patterns
• scientific article; zbMATH DE number 1507230
• Generating permutations with restricted containers
• Restricted permutations
• Finite automata for languages of combinatorial interest: An order theoretical point of view

Cites work

• scientific article; zbMATH DE number 3492580 (Why is no real title available?)
• scientific article; zbMATH DE number 1447312 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Forbidden subsequences and Chebyshev polynomials
• Generating trees and the Catalan and Schröder numbers
• Partially well-ordered closed sets of permutations
• Permutations generated by token passing in graphs
• Restricted 132-avoiding permutations
• Restricted permutations
• Sorting Using Networks of Queues and Stacks

Cited in

(18)

• Geometric grid classes of permutations
• Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
• Generating permutations with restricted containers
• Inflations of geometric grid classes of permutations
• Combinatorial specifications for juxtapositions of permutation classes
• Reduced word manipulation: patterns and enumeration
• Simple permutations: Decidability and unavoidable substructures
• On pattern avoidance in matchings and involutions
• Finite automata for languages of combinatorial interest: An order theoretical point of view
• Labelled well-quasi-order for permutation classes
• On the least exponential growth admitting uncountably many closed permutation classes
• Permutations generated by stacks and deques
• Sorting by shuffling methods and a queue
• Sorting by shuffling methods and a queue
• scientific article; zbMATH DE number 1507230 (Why is no real title available?)
• Permuting machines and permutation patterns
• Permuting machines and priority queues
• Growing at a perfect speed

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426439)