Abstract
Classes of finite-automation functions are considered in the paper and each state of those functions realizes a function from some closed class D of the k-valued logic (P-sets). It is proved that there exists continuum of precomplete classes C containing an arbitrary P-set. The problem of existence of a completeness criterion for systems containing P-sets is also considered.
References
V. B. Kudryavtsev, S. V. Aleshin, and A. S. Podkolzin, Introduction to Automata Theory (Nauka, Moscow, 1985) [in Russian].
V. B. Kudryavtsev, “Cardinality of Sets of Precomplete Sets of Some Functional System Related to Automata,” Problemy Kibern., No. 13, 45 (1965).
S. S. Marchenkov, “On Slupecki Classes for Automaton Functions,” Diskret. Matem. 10(2), 37 (1998) [Discrete Math. Appl. 8 (3), 299 (1998)].
V. A. Buevich, “The Completeness Criterion for Systems which Contain All One-Place Finite-Automaton Functions,” Diskret. Matem. 12(4), 69 (2000) [Discrete Math. Appl. 10 (6), 613 (2000)].
S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, The Functions of Algebra of Logic and Post Classes (Nauka, Moscow, 1966) [in Russian].
A. B. Ugol’nikov, Post Classes (Moscow State Univ., Mech. Math. Dept., Moscow, 2008) [in Russian].
S. V. Aleshin, “Über ein Vollstänig klits kriterium für Automatenabildungen beruglich der Superposition,” Ros-toker Math. Kolloq. 5, 119 (1977).
Author information
Authors and Affiliations
Additional information
Original Russian Text © A. A. Rodin, 2013, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2013, Vol. 68, No. 1, pp. 51–53.
About this article
Cite this article
Rodin, A.A. Some properties of P-sets of finite-automaton functions. Moscow Univ. Math. Bull. 68, 71–73 (2013). https://doi.org/10.3103/S0027132213010151
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132213010151