zbMATH — the first resource for mathematics

On completeness of the binary boundedly determined functions with respect to superposition. (English. Russian original) Zbl 0728.94011
Discrete Math. Appl. 1, No. 4, 423-431 (1991); translation from Diskretn. Mat. 1, No. 4, 86-91 (1989).
It is shown that the systems of one-place b.d. (boundedly determined) functions and Boolean functions and the systems of two-place b.d. functions are complete. These results are obtained as consequences of the properties of automata realizing - by superposition - a b.d. function g which copies a given b.d. function f. Also, it is mentioned an example of a system of b.d. functions, which is not contained in any precomplete relative to superposition class of functions and is not complete.
Reviewer: L.Livovschi

94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
PDF BibTeX Cite
Full Text: DOI