The Hadamard coincidence theorem (paper §5): a series is Hadamard-finite if and only if it is Hadamard-recognisable. The "recognisable implies finite" direction reads off the generator tuple $A.sem (X_i)$; the "finite implies recognisable" direction extends the witnessing tuple by the series itself and builds the automaton from the closure under left derivatives.