Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
References
V. A. Buevich and M. A. Podkolzina, “On Completeness of S-Sets of Deterministic Functions,” in Proc. IX Intern. Seminar “Discrete Mathematics and its Applications” (Moscow, 2007) [in Russian].
V. A. Buevich and M. A. Podkolzina, “A Criterion of Completeness for S-Sets of Deterministic Functions,” Matem. Voprosy Kibern. 16, 191 (2007).
V. B. Kudryavtsev, “On Properties of S-Systems of Functions of κ-Valued Logic,” Elektron. Informationsverarb. und Kybern. 9(1/2), 8 (1973).
S. V. Yablonskii, Introduction to Discrete Mathematics (Nauka, Moscow, 1980) [in Russian].
V. A. Buevich, “On τ-Completeness in the Class of Deterministic Functions,” Doklady Russ. Akad. Nauk 326(3), 399 (1992).
V. A. Buevich, Conditions of Γ′-Completeness for Finite Automata, Part 2 (Izd-vo MGU, Moscow, 1987) [in Russian].
Author information
Authors and Affiliations
Additional information
Original Russian Text © M.A.Podkolzina, 2009, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2009, Vol. 64, No. 1, pp. 61–62.
About this article
Cite this article
Podkolzina, M.A. The number of S-precomplete classes in the functional system P τ κ . Moscow Univ. Math. Bull. 64, 39–40 (2009). https://doi.org/10.3103/S0027132209010094
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132209010094