Regular closed classes of permutations
From MaRDI portal
Publication:6472080
arXivmath/0209022MaRDI QIDQ6472080FDOQ6472080
Michael Albert, N. Ruškuc, Mike Atkinson
Publication date: 2 September 2002
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 page was built for publication: Regular closed classes of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6472080)
