We introduce the vertical and horizontal insertion encodings for Cayley permutations which naturally generalise the insertion encoding for permutations. In both cases, we fully classify the Cayley permutation classes for which these languages are regular, and provide an algorithm for computing the rational generating functions. We use our algorithm to solve an open problem of Cerbai by enumerating the hare pop-stack sortable Cayley permutations.