Upper Estimate of Partial Prediction Degree for General Regular Superevents
- 2 Downloads
A machine predicts the next character in the input sequence if it outputs that character at the previous moment of time. In this paper we study the upper bound of prediction degree for some general regular superevents. The paper presents an upper bound for superevents predicted by the machine representing the superevents. In addition, the class of superevents is presented which this bound is attained for.
Unable to display preview. Download preview PDF.
The author is grateful to Prof. E. E. Gasanov for formulation of the problem and help in the work.
- 4.A. A. Mastikhina, “Criterion of Partial Prediction of General Regular Superevents,” Diskret. Matem. 23 (4), 103Google Scholar
- 5.I. K. Vedernikov, “Analysis of the Algorithm Specifying Output Function of Prediction Machine,” Intellekt. Sistem. Teor. Prilozh. 20 (3), 103 (2016).Google Scholar