Claim FPRD-T28

Exact statement

Every finite generalized Dyck-control presentation has a finite positive state-pair suffix equation system whose components recognize exactly the well-nested traces carrying the selected DFA between their endpoint states; every recursive dependency has positive delay, so the system has one exact suffix solution recovered at depth N plus one through trace length N, and letter-to-letter decoding gives exact remaining-suffix behavior on the output alphabet with the same bounded observation index.

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

The source literature supplies language-level representation and finite-control intersection. M18 proves the concrete FPRD product, delay certificate, suffix readout, and finite-shadow transfer.

Open work

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

Notes

The source literature supplies language-level representation and finite-control intersection. M18 proves the concrete FPRD product, delay certificate, suffix readout, and finite-shadow transfer.