A note on superassociative algebra of terms determined by singular mappings on a finite set.

In this paper, we study some classes of terms, called trees, which play a key role in both universal algebra and theoretical computer science. We introduce the concept of terms defined by singular transformations and provide some concrete examples. We also prove that the set of such terms together with an operation of type (n + 1) for a fixed natural number n defined on that set forms an algebra of type (n + 1) satisfying the axiom of superassociativity. [ABSTRACT FROM AUTHOR]