Recently, G. ASSER has obtained two interesting characterizations of the class of unary primitive recursive string-functions over a fixed alphabet as Robinson algebras. Both characterizations use a somewhat artificial string-function, namely the string-function lexicographically associated with the number-theoretical excess-over-a-square function. Our aim is to offer two new and natural Robinson algebras which are equivalent to ASSER’S algebras.