Regular closed classes of permutations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
21 pages, 2 figures

Keywords

Combinatorics, 05A15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/64834

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0209022
 http://arxiv.org/abs/math/0209022

Collections

arXiv