Regular closed classes of permutations

Simple item page
dc.creatorAlbert, M.
dc.creatorAtkinson, M. D.
dc.creatorRuskuc, N.
dc.date2002-09-03
dc.date.accessioned2026-07-07T04:50:33Z
dc.date.available2026-07-07T04:50:33Z
dc.descriptionMachines 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.
dc.description21 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0209022
dc.identifierhttp://arxiv.org/abs/math/0209022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64834
dc.subjectCombinatorics
dc.subject05A15
dc.titleRegular closed classes of permutations
dc.typetext

Files

Collections

arXiv