The number of S-precomplete classes in the functional system P τ κ
M. A. Podkolzina · Moscow University Mathematics Bulletin · 2009
The problem on the number of precomplete classes in the functional system P is considered, elements of P are deterministic S-functions defined on words of length τ composed from letters of an alphabet of cardinality κ. An asymptotics for the number of S-precomplete classes in P is obtained for arbitrary fixed κ and τ tending to infinity.