he number of S-precomplete classes in the functional system P_k^r / M. A. Podkolzina. //Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2009. № 1. P. 62-63
[Moscow Univ. Math. Bulletin. Vol. 64,
N 1, 2009. P. 39-40].
The problem on the number of precomplete classes in the functional system P_k^\tau is considered, elements of P_k^\tau are deterministic S-functions defined on words of length \tau composed from letters of an alphabet of cardinality k. An asymptotics for the number of S-precomplete classes in P_k^\tau is obtained for arbitrary fixed k and \tau tending to infinity.
