Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
REGULAR CLOSED SETS OF PERMUTATIONS
 

Summary: REGULAR CLOSED SETS OF
PERMUTATIONS
M.H. Albert, M.D. Atkinson
Department of Computer Science
University of Otago, New Zealand
and
N. Ruskuc
School of Mathematics and Statistics
University of St Andrews, UK
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 nite automata and avoided pattern techniques. Conditions are
given for these sets to be enumerated by rational generating functions.
As a consequence we give the rst non-trivial examples of pattern
closed sets of permutations all of whose closed subclasses have rational
generating functions.
Keywords Regular sets, permutations, involvement
1 Introduction
From the earliest days of Computer Science abstract machines have been

  

Source: Atkinson, Mike - Department of Computer Science, University of Otago

 

Collections: Computer Technologies and Information Sciences