This article is cited in 1 paper

Part 3. Mathematical models

A class of machine sufficient for optimal prediction of general regular super-events

I. K. Vedernikov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: The machine predicts the next character of the input sequence if it outputs that character the moment before. The paper considers the machine class contraction for the task of predicting an arbitrary general regular super-event in the multivalued alphabet. The class of machine sufficient for the predicting problem is obtained in this paper. In addition, the transition from the estimations of simple super-events to the estimations of the complex super-events is proved with the help of the class aforementioned.

Keywords: predicting machine, prediction of superwords by a machine, general regular super-events.