Admitted Continuations, Registered Exclusions and Loss of Distinguishability in Finite Generative Systems under a Limit
We study the relation between a finite graph of admitted continuations and the minimal automaton of the language that records, step by step, how many continuations were excluded (the S1 registration of exclusions). The first object (QUANTO, the admitted continuations) is primary; the second is a distinct object built from it. For bases that are strongly connected, have a single branching vertex, first returns of pairwise distinct lengths and coprime return lengths, we prove that the one-phase clock lift and its registration have the same non-zero spectrum with multiplicity, and we give both characteristic polynomials in closed form. The registration is nevertheless delayed: the longest label word that leaves the phase undetermined has length dL − 2, so the phase is determined after at most dL − 1 labels; the first pair of continuations is separated after dℓ_min steps and the last pair after dℓ^(2) steps. Inside every block between two border events the unread distinction follows a forced succession: one step of deviation of mass r − 1, recall of the same mass spread over a computable number of steps, closure to zero at the next event. Iterating the lift is a multiplicative dilation of the clock. Coupling two bases through one common branching vertex preserves the spectral coincidence if and only if no return length greater than one is shared; otherwise the growth of the admitted continuations strictly exceeds the growth of the registration. This gap is created by the coupling, is absent in each part and in the uncoupled sum, and is reconstructible from the two isolated registrations. All statements are proved; computations on frozen families serve as controls, and two refuted predictions are reported.
Authors
- davide lugli
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24407594
- Primary Topic
- semigroups and automata theory
- Type
- preprint