Article
Licensed
Unlicensed
Requires Authentication
Adjustment experiments for automata with variable logic of behaviour
-
A. E. Kirnasov
Published/Copyright:
May 1, 2005
We investigate the dependence of the length of a simple conditional adjustment experiment for an automaton on local transformations of the transition diagram and outputs of the automaton. We give upper and lower bounds for the Shannon function of the length of experiments if any p arrows in the Moore diagram of the automaton can be redirected and the values of the output function in any p points can be changed.
Published Online: 2005-05-01
Published in Print: 2005-05-01
Copyright 2005, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- 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
Articles in the same Issue
- 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
