Endpoint Decomposition and an Anti-Lyndon Aperiodicity Criterion for PLRS Numeration

Canonical positive linear recurrence sequence numeration systems admit a natural deterministic threshold-reset automaton for their legality languages. Paper IV showed that, after minimization, every presentation of a fixed system yields the automaton of the canonical reduction. The present paper studies the internal transition structure of that canonical automaton. We introduce anchored…