2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2004
Pattern avoidance classes and subpermutations
M. D. Atkinson, M. M. Murphy, N. Ruskuc
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case…
math.CO2002★ 2 cited
Regular closed classes of permutations
M. Albert, M. D. Atkinson, N. Ruskuc
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…