Article
Licensed
Unlicensed
Requires Authentication
On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
-
M. A. Podkolzina
Published/Copyright:
June 30, 2009
Abstract
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.
Received: 2008-09-17
Published Online: 2009-06-30
Published in Print: 2009-July
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric
- New methods of investigation of perfectly balanced Boolean functions
- On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
- On repetition-free Boolean functions over pre-elementary monotone bases
- Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions
- Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials
- On a class of statistics of polynomial samples
- Score lists in [h-k]-bipartite hypertournaments
- On one statistical model of steganography
Articles in the same Issue
- Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric
- New methods of investigation of perfectly balanced Boolean functions
- On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
- On repetition-free Boolean functions over pre-elementary monotone bases
- Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions
- Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials
- On a class of statistics of polynomial samples
- Score lists in [h-k]-bipartite hypertournaments
- On one statistical model of steganography
