  While automata theory often concerns itself with regular predicates,
relations corresponding to acceptance by a finite state automaton, in this
article we study the regular functions, such relations which are also functions
in the set-theoretic sense. Here we present a small (but necessarily infinite)
collection of (multi-ary) functions which generate the regular functions under
composition. To this end, this paper presents an interpretation of the powerset
determinization construction in terms of compositions of input-to-run maps.
Furthermore, known results using the Krohn-Rhodes theorem to further decompose
our generating set are spelled out in detail, alongside some coding tricks for
dealing with variable length words. This will include two clear proofs of the
Krohn-Rhodes Theorem in modern notation.
