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.

中文翻译：

---

一般常规超事件的部分预测度的上估计

如果机器在前一时间输出该字符，则它会预测输入序列中的下一个字符。在本文中，我们研究了一些常规正则事件的预测度上限。本文介绍了由代表超级事件的机器预测的超级事件的上限。此外，还提供了达到此限制的超事件类。