Counter-Minimisation for Tropical CRAs

• The paper establishes that register minimisation is undecidable for tropical CRAs with seven or more registers via reduction from the 0-halting problem of two-counter machines.
• The methodology exploits the expressive equivalence between k-register CRAs and width-k tropical WFAs to map register count to automata width.
• The results imply significant limits on optimization techniques in quantitative models and indicate unresolved cases for register counts k ≤ 6.

The counter-minimisation problem for tropical (min-plus) Cost Register Automata (CRAs) concerns the question of whether, for a given $k$-register CRA, one can construct an equivalent CRA with strictly fewer than $k$ registers. CRAs over the min-plus semiring $\mathbb{Z}_{\min}$ are expressively equivalent to min-plus (tropical) Weighted Finite Automata (WFAs), and minimizing the number of registers within CRAs is directly analogous to minimizing the width of these WFAs. The recent resolution of this problem establishes that register minimisation is undecidable for $k\geq7$ registers, whereas the problem remains open for smaller register counts (Almagor et al., 10 Dec 2025).

1. Min-Plus Semiring and Tropical Cost Register Automata

A tropical (min-plus) semiring is defined over the domain $\mathbb{Z}_{\min} = \mathbb{Z} \cup \{\infty\}$, with the operations $a \oplus b = \min(a, b)$ and $a \otimes b = a + b$. The key properties are $\infty + x = \infty$ and $\min(\infty, x) = x$. A $k$-register CRA over $(\mathbb{Z}_{\min}, \oplus, \otimes)$ is formalized as the tuple

$\mathcal{C} = (Q, \Sigma, q_0, F, R, \delta),$

where:

• $Q$ is a finite set of states,
• $q_0 \in Q$ is the initial state,
• $F \subseteq Q$ is the set of accepting states,
• $R = \{r_1, \ldots, r_k\}$ is a finite set of registers over $\mathbb{Z}_{\min}$,
• $$\delta \subseteq Q \times \Sigma \times \mathrm{Upd} \times Q$$ is the transition relation, with: $$\mathrm{Upd} = (R \to (R \cup \{\mathit{const}\}) \times \mathbb{Z}),$$ assigning to each register either a pair $(r_j, c)$ for copy-update or $(\mathit{const}, c)$ for constant reset.

A run is a unique sequence of configurations and register assignments starting from all-zero registers. If the final state is not accepting, the output is $\infty$. Otherwise, the value in a designated output register gives $\mathcal{C}(w) \in \mathbb{Z}_{\min}$.

2. Formal Statement of the Counter-Minimisation Problem

The problem is specified as follows:

• Input: A $k$-register CRA $\mathcal{C}$.
• Question: Does there exist an equivalent CRA $\mathcal{C}'$ with strictly fewer than $k$ registers (i.e., with $k-1$ registers)?

Equivalently, for fixed $k$, is it decidable if a $k$-register CRA admits a representation with fewer registers preserving its behavior over all input words? The set of such minimal CRAs is precisely those not equivalent to any CRA with one fewer register.

3. Central Undecidability Result

The core result establishes that for every $k \geq 7$, the following decision problem is undecidable:

$\forall k\geq 7, \quad \text{“Given a %%%%29%%%%-register CRA %%%%30%%%%, decide if %%%%31%%%% equivalent %%%%32%%%%-register CRA.”}$

Thus, for $k \geq 7$ registers, counter-minimisation for tropical CRAs is undecidable (Almagor et al., 10 Dec 2025).

4. Reduction and Undecidability Proof Outline

The proof reduces from the classically undecidable “0-halting” problem for two-counter machines. The key technical construction involves:

• Encoding the behavior of a two-counter machine $M$ in a tropical WFA $A$ of width $6$, linking the halting behavior to whether $A$ is unbounded above.
• “Padding” $A$ with a seventh register produces a CRA $\mathcal{C}$ with $7$ registers. If $A$ is upper-bounded, the additional register is redundant and removable; if $A$ is unbounded, any equivalent CRA must maintain all $7$ registers to correctly describe the behavior.
• Thus, deciding whether $\mathcal{C}$ can be realized with $6$ registers solves the undecidable question regarding boundedness of $A$.

This construction follows the earlier approach of Almagor–Chatterjee–Dima (2020) regarding undecidability in WFAs and exploits the expressive equivalence between $k$-register CRAs and width-$k$ WFAs.

5. Structural and Expressive Connections

There is an exact correspondence between $k$-register CRAs and width-$k$ min-plus WFAs, where width is the maximal number of simultaneous nondeterministic states reachable in the WFA. The conversion involves interpreting each register as a “dimension” in the WFA, and simulating nondeterministic branching by parallel register assignment.

A table comparing these concepts:

Model	Resource Parameter	Expressivity Determined By
CRA	$k$ registers	Number of independent cost tracks (registers)
Tropical WFA	Width $k$	Max number of concurrent states reachable

This equivalence underpins reductions between the two models and is crucial for the undecidability result.

6. Boundary Cases and Related Decidability Results

The status of the counter-minimisation problem for $k \leq 6$ remains unresolved; no matching lower bounds exist for $k$ below $7$. In contrast, for CRAs over the rational field $(\mathbb{Q},+, \times)$, register minimisation is decidable, as established by Ben Alioua et al. 2024.

Further, related problems include:

• Determinisation of tropical WFAs (recently shown decidable).
• Unambiguisability (decidability of equivalence to an unambiguous WFA).

A plausible implication is that structural restrictions on the underlying semiring or register management could lead to decidability in other settings.

7. Key Constructions and Lemmas

Two pivotal techniques support the proof and its generalizations:

• Expressive Equivalence Lemma: $k$-register CRAs are expressively equivalent to width-$k$ min-plus WFAs by simulating register updates via WFA state space and by simulating WFA subset constructions through register allocation.
• Gadget for Width Jump: In the main reduction, adding a spare register allows mimicking the others only if the automaton is bounded; otherwise, the spare becomes essential and cannot be eliminated, forcing the need for all $7$ registers.

These technical constructions confirm the undecidability for $k \geq 7$ and clarify the critical role of width and register tracking in capturing quantitative behaviors within min-plus models.

---

For foundational and technical details see (Almagor et al., 10 Dec 2025), as well as [Alur, Moerkotte et al. (ICALP 2013)], [Almagor, Chatterjee, Dima (FSTTCS 2020)], and [Bell, Jecker, Seidl (LICS 2023)].