On the Convolution of Information in a Classical Probability Scheme

Two problems are considered connected with the transformation of information by a finite memoryless automaton with $n$ inputs and $l$ outputs $(l<n)$. Properties of the input alphabet are indicated which give the minimum information dispersion. Simple rules are found for the approximate solution of the problem of minimizing the information dispersion with an estimate of the error.