vix.ing · top · new · best · stats · spec

Regular closed classes of permutations

2002/09/03 by M. Albert, Michael Albert, Albert, M. +5
Engineering · Mathematics · #05A15 #Advanced Combinatorial Mathematics #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #math.CO #msc:05A15

paper · pdf · doi:10.48550/arxiv.math/0209022

21 pages, 2 figures

arxiv created 2002/09/03 · openalex publication_date 2002/09/03 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related