On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
M. A. Podkolzina · Discrete Mathematics and Applications · 2009
We consider the problem on completeness of sets of S -functions, the determinate functions such that the automaton calculating them realises in each state functions which emanate no value. We assume that each set of S -functions whose completeness is checked in this paper contains all S -functions depending on at most one variable. We describe all A -precomplete classes of such sets. It is shown that there exists an algorithm recognising A -completeness of S -sets of one-place determinate functions containing all one-place determinate S -functions.