Proof of `Finite-state evaluation of terminating branch words` (1st statement)
groundedproofs/Lax369799Proofs/FiniteBranchWords.lean · lax-369799
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
Acceptance of a terminating branch word is membership of its iterated unary evaluation in the accepting nullary set.