Claim FPRD-T24

Exact statement

Every finite Greibach recognition presentation induces one-half contractive operators on the finite products of exact language behaviors and full set-valued suffix behaviors; both have unique fixed points, bottom unfoldings at depth N plus one are exact on words and input rows through length N, the vector suffix lift identifies the two solutions, and their readout equals ordinary finite CFG derivability.

Statusinformal proof

External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

This row is imported exactly from the governed FPRD claims ledger. The matrix assignment records normalized inventory coverage; it is not a new proof or a promotion of the ledger status.

Proof or evidence

The ledger points to OPEN_PROBLEMS.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

OPEN_PROBLEMS.md →

Verification notes

Reviewed on 2026-08-25 for identifier, status, provenance, evidence-link presence, and dependency import only. Mathematical proof audit remains the next action unless separately documented.

Limitations

Greibach normal form, CFG adequacy, and guarded metric mechanisms have classical or prior sources. M16 must prove their exact system-level synthesis in the readout-aware FPRD suffix architecture.

Open work

Audit the proof against its dependencies and publish a self-contained evidence summary before increasing maturity.

Notes

Greibach normal form, CFG adequacy, and guarded metric mechanisms have classical or prior sources. M16 must prove their exact system-level synthesis in the readout-aware FPRD suffix architecture.