We study successor-bispecial strings over an alphabet $Σ$ of size $σ$, a minimal-branching analogue of de Bruijn strings, and ask how few Burrows--Wheeler transform (BWT) runs are possible. In a de Bruijn string of order $k$, every $(k-1)$-gram has all $σ$ right-extensions; here, every $(k-1)$-gram has exactly two right-extensions, determined by a successor rule, which also forces two left-extensions. For order $3$, we construct an explicit family $B_σ^{(3)}$, for every $σ\geq 2$, whose cyclic BWT has $r_c = σ^2 + 2$ runs. A suitable terminated linearization has the same run count, $r = r_c = σ^2 + 2$, while the smallest suffixient set has size $χ= 2σ^2 + 1$. The ratio $χ/r = 2 - 3/(σ^2 + 2)$ nearly saturates the known bound $χ/r \leq 2$, which we have previously shown to be asymptotically tight. Compared with our earlier general construction, this improves the gap from $O(1/σ)$ to $O(1/σ^2)$. We also show that the order-$3$ pattern appears as a blockwise two-row projection of normalized linear-feedback shift register (LFSR) de Bruijn sequences over $\mathbb F_q$, when primitive trinomials $x^3 - x + c$ exist. For higher orders, we prove a general lower bound $r_c \geq σ^{k-1} + 2$ for every $σ\geq 3$ in the exact-length regime and analyze the boundary-merged higher-order candidate using the last-to-first (LF) permutation: it fails for $k = 4$ and all $σ\geq 3$, while verified $k = 5$ instances for $σ\in {3,4}$ yield $χ/r$ ratios exceeding $1.96$.

翻译：暂无翻译