A new paper introduces a computationally efficient algorithm for right-to-left automaticity. The author also presents a prediction method for arithmetic repetition complexity to handle mix-automatic sequences. This research builds on compositional learning frameworks. These technical refinements offer practitioners more precise tools for analyzing sequence predictability and algorithmic complexity in formal systems.