Context
Exponential Green height in unrestricted transformation semigroups was a tempting route to long certificates, but the relevant quantity is target reachability inside an L-trivial action.
Hypotheses and scope
- All unordered generator pairs, including equal generators, on four labelled states are included.
- L-triviality is tested exactly on each finite generated monoid; no accessibility or DFA-minimality filter is imposed.
Proof or evidence
Exact closure and Cayley-graph computations give height histogram 1:122, 2:1218, 3:2112, 4:636, 5:360, 6:24, plus the trivial height-zero monoid. Rank-conditioned target distances never exceed three.
Verification notes
The executable output records every aggregate count and an explicit ten-element height-six example.
Limitations
- This finite control does not exclude a useful asymptotic relation between height and distance under additional hypotheses.
- The extremal pair is not claimed to present a minimal four-state DFA.