Intrinsic Recognition of Canonical PLRS Legality Automata

Paper IV showed that every presentation of a canonical positive linear recurrence sequence (PLRS) numeration system determines a threshold-reset automaton, and that this automaton minimizesto the threshold-reset automaton of the canonical reduction. Left open there was the converse recognition problem: given an arbitrary minimal deterministic automaton over an ordered digitalphabet, with no…