Context
A bounded sequence of finite-horizon fits yields one stationary recognizer only because a fixed normalized stratum contains finitely many machines.
Hypotheses and scope
- Every stratum is finite after canonical renaming.
- The index bounds states, alphabets, degree, observation distance, tables, initial state, and accepting set.
Proof or evidence
One PEG gives one scaffold for the reversed language and therefore a uniform bound. Conversely, one machine in a fixed finite stratum recurs at unbounded horizons; it agrees with the reversed language on every word, and the scaffold-to-PEG theorem completes the argument.
Verification notes
The reversal, minimum existence, monotonicity, finite-pigeonhole step, and necessity of finite normalized strata were independently rederived from the written proof and the cited correspondence.
Limitations
- The theorem is not a compactness principle for arbitrary infinite resource classes.
- It does not prove that context-free languages have bounded presentation demand, or that any particular language escapes.
Notes
The forward implication uses LMR Theorem 16. The reverse implication is finite pigeonhole sewing inside one K_k followed by the scaffold-to-PEG direction of that theorem, with reversal explicit. The result requires finite normalized strata; it is not an unrestricted compactness claim and opens no M34.