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

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↗
arXiv2026

An Ordinal Extension Characterization of the Regular Languages with Applications

Given a language $A$ and a positive integer $j$, a $j^{\text{th}}$ $A$-extension is a string $y$ for which there exists a string $x$ such that $y$ is the $j^{\text{th}}$ string satisfying $xy \in A$. In this paper we show that ordinal extensions ($j^{\text{th}}$ $A$-extensions for various $A$ and $j$) constitute a subtle, but remarkably useful concept. We characterize the regular languages in terms of ordinal extensions, and we extract from this characterization two general methods for giving very easy proofs of nonregularity.

cs.FL↗
arXiv2026

Rational polynomial solvability reduces to stratifiability of semilinear sets

A semilinear set is stratifiable if it is a finite union of linear sets whose periods have at most two nonzero coordinates, with no two periods in one component connecting alternating pairs of coordinates. We give a computable many-one reduction from the existence of a rational zero of an integer polynomial to deciding stratifiability. After the classical reduction to quadratic systems, we reduce rational solvability of these systems to a problem we call finite separation by Cartesian products of rational linear forms. Its input consists of rational subspaces $D_1,\ldots,D_k\le\mathbb Q^r\times\mathbb Q^r$. A separator is a map $(\boldsymbol x,\boldsymbol y)\mapsto(u(\boldsymbol x),v(\boldsymbol y))$, where $u,v\colon\mathbb Q^r\to\mathbb Q$ are nonzero rational linear forms. The problem asks whether finitely many separators suffice so that every pair outside $\bigcup_iD_i$ receives, from some separator, a value attained at no pair in that union. We then reduce this problem to stratifiability. Ginsburg and Spanier's characterization of letter-bounded context-free languages} also induces a reduction from rational polynomial solvability to context-freeness of letter-bounded languages specified by semilinear exponent sets. An OpenAI preprint claims undecidability of rational polynomial solvability; if correct, our result settles the decidability of general stratifiability, a problem open since 1966.

cs.FL↗