提出右到左自动性预测算法，解决字符串复杂度建模新问题。
Stringological sequence prediction II: Right-to-left automaticity and related complexity measures
- 设计基于右到左自动性的高效预测算法
- 实现对混合自动序列的准确预测
- 适用于字符串复杂度分析与序列建模场景
在前期工作中，我们开始研究适配字符串复杂度度量的序列预测算法。其中考虑了一种从左到右（最高位优先）的自动性度量。本文提出一种适配其对偶——从右到左（最低位优先）自动性的统计与计算高效的算法，该方法在实际应用中表现出显著差异。此外，我们还设计了一种针对更丰富表达能力的度量——‘算术重复复杂度’的预测算法，该度量可用于预测所谓的混合自动序列。
原文摘要 · Abstract (English)
In a previous paper, we began the study of sequence prediction algorithms adapted to stringological word complexity measures. One measure we considered was left-to-right (most-significant-digit-first) automaticity. Here, we show a statistically and computationally efficient algorithm adapted to the ``dual'' right-to-left (least-significant-digit-first) automaticity, which turns out to be substantially different for our purpose. We also demonstrate a prediction algorithm for a more expressive measure that we call ``arithmetic repetition complexity''. In particular, the latter can be used for predicting the so-called mix-automatic sequences.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。