Regular closed classes of permutations
classification
🧮 math.CO
keywords
permutationssetsanalysedariseautomataavoidedclassesclosed
read the original abstract
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by rational generating functions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.