Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.17369

Stringological sequence prediction II: Right-to-left automaticity and related complexity measures

Vanessa Kosoy
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

cs.FLcs.DScs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vanessa Kosoy. 2026-07-19. Stringological sequence prediction II: Right-to-left automaticity and related complexity measures. https://arxiv.org/abs/2607.17369

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Distributional Learning of Context-Free Languages under Fixed Finite-Semigroup Typing

We study positive-data learning of context-free languages whose nonempty factors are typed by a fixed morphism $s:Σ^+\to S$ into a finite semigroup. A polynomial-time set-driven operator reconstructs each substitutable target from finite positive witnesses; a separate conservative learner identifies nonempty targets in Gold's sense. The encoded characteristic-data size is polynomial in grammar size and a typed shortest-yield parameter. Ordinary grammar thickness suffices when the typing is determined by a fixed prefix-suffix window and a finite-group value; for linear targets, linear grammar size alone suffices. Conversely, a fixed two-element semilattice typing yields finite targets with grammars of size and ordinary thickness both $O(n)$ that require exponentially long characteristic samples. The lower bound applies to any set-driven operator admitting characteristic samples for the fixed-typing class. Retyping closure, examples beyond fixed windows, and a Dyck-language obstruction delineate the framework's scope.

cs.FL↗
arXiv2026

Beyond the Turing threshold: Productive grammars generate essentially undecidable languages

Emil Post's productive sets are not even semi-computable, let alone computable, being thus essentially incomputable. Accordingly, formal languages whose set of words is a (completely) productive set are essentially undecidable. In this article, I elaborate on Post productivity from the viewpoint of formal language theory: I design formal grammars that emulate the construction of productive sets of natural numbers and are thus beyond Turing-decidability.

cs.FL↗
arXiv2026

When Does Tool Use Increase the Expressive Power of Finite-Precision Recurrent Models?

Modern sequence models are increasingly deployed as agents that interleave token generation with calls to external tools. We study when such tool access increases computational expressivity. We model any fixed finite-precision recurrent sequence model, including finite-precision state-space models (SSMs) with $B$ bits of internal state, as a deterministic finite-state controller interacting with an oracle through a finite command/observation interface, and establish a separation between the two regimes analyzed. First, every finite-state bounded-interface tool with memory set $M$ can be internalized at a cost of at most $\lceil\log_2|M|\rceil+O(1)$ recurrent bits, so the combined system remains finite-state. Second, a single unbounded tape with only local $\mathtt{read}$/$\mathtt{write}$/$\mathtt{move}$ commands suffices for Turing completeness: every single-tape Turing machine with state set $Q$ and tape alphabet $Γ$ is simulated by a controller with $O(\log|Q|+\log|Γ|)$ recurrent bits, and $\mathrm{EQ}_n$ requires $2^n$ states without tools but one constant-size controller with the tape. Third, this construction is realized exactly by a one-layer finite-precision \emph{selective} affine SSM with binary one-hot states, $\{0,1\}$ transition matrices, and zero biases. Under explicitly stated resource conventions, $O(\log B)$ recurrent bits suffice for tape-assisted simulation of any $B$-state Turing machine, whereas directly realizing an arbitrary $B$-state transition map in one exact affine update without external memory requires total recurrent dimension exactly $B-1$. Fixed description size, occupied tape cells, and interaction cost are reported separately from recurrent memory. Our results concern exact expressivity under deterministic semantics, not learnability or empirical performance.

cs.FL↗