Earlier, the authors introduced classes of alphabetic operators that have greater computational possibilities than classical algorithms. In Dokl. Akad. Nauk SSSR 321, No. 5, 876-879 (1991), they gave a uniform procedure for obtaining such alphabetic operators, which will be called transrecursive operators in what follows. It was proved that transrecursive operators give the most general algorithmic scheme for mappings of sets of words. In this article we give a precise definition of such a procedure and consider operations on transrecursive operators that are similar to operations obtained in the theory of algorithms [\textit{V. M. Glushkov}, Kibernetika 1965, No. 5, 1-9 (1965; Zbl 0156.018)]: sequential composition, \(\alpha\)-composition, and \(\alpha\)-iteration. In the class of transrecursive operators the given operations differ essentially in a number of aspects. For example, they can have various types and forms.