Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the length of checking test for repetition-free functions in the basis {0, 1, &, ∨, ¬}
-
A. A. Voronenko
Veröffentlicht/Copyright:
1. Mai 2005
In this paper, we present upper and lower linear bounds for the Shannon function for length of checking tests for repetition-free functions in the basis {0, 1, &, ∨, ¬}.
Published Online: 2005-05-01
Published in Print: 2005-05-01
Copyright 2005, Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- A power divergence test in the problem of sample homogeneity for large numbers of outcomes and trials
- The Poisson approximation for the number of matches of values of a discrete function on segments of a sequence of random variables
- A theorem on probabilities of large deviations for decomposable statistics which do not satisfy the Cramér condition
- An upper bound for the number of functions satisfying the strict avalanche criterion
- Adjustment experiments for automata with variable logic of behaviour
- Equational closure
- Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3
- On the length of checking test for repetition-free functions in the basis {0, 1, &, ∨, ¬}
- Touchard C-polynomials and quasi-orthogonal to them polynomials
Artikel in diesem Heft
- A power divergence test in the problem of sample homogeneity for large numbers of outcomes and trials
- The Poisson approximation for the number of matches of values of a discrete function on segments of a sequence of random variables
- A theorem on probabilities of large deviations for decomposable statistics which do not satisfy the Cramér condition
- An upper bound for the number of functions satisfying the strict avalanche criterion
- Adjustment experiments for automata with variable logic of behaviour
- Equational closure
- Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3
- On the length of checking test for repetition-free functions in the basis {0, 1, &, ∨, ¬}
- Touchard C-polynomials and quasi-orthogonal to them polynomials
