The insertion encoding of restricted growth functions

Abstract

We adapt the vertical and horizontal insertion encodings of Cayley permutations to enumerate restricted growth functions, which are in bijection with unordered set partitions. For both insertion encodings, we fully classify the classes for which these languages are regular. For the horizontal insertion encoding, we also prove that the conditions to be regular are the same for restricted growth functions of matchings.