Proof of `Linearly-finite and recognisable series` (5th statement)
groundedproofs/Lax619925Proofs/Recognisable.lean · lax-619925
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The equality (zeroness) problem is decidable for recognisable series over a finite alphabet (paper §4). The decider reads, as a , the linear-algebra condition that the initial vector annihilates the subspace reachable from the final vector: iff that annihilation holds (), and the annihilation condition is decidable (it lives in the finite-dimensional space ), so is.