The Equational Specification of Finite Minimal Unoids Using only Unary Hidden Functions

Abstract

In [5] it has been proved that by using hidden functions the number of equations needed to specify a finite data type is bounded by numbers depending only on the signature of that data type. In the special case of a finite minimal unoid, however, it seems to be relevant to ask whether or not a specification can also be made by a bounded number of equations using only unary hidden functions.

In this paper we prove that this can be done.