FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T25

Claim FPRD-T25

Exact statement

A language is context-free exactly when it is the complete-match observation of the unique suffix fixed point of a finite Greibach recognition presentation; thus every context-free language has a finite terminal-delayed presentation with coherent exact bounded observations and uniform remaining-suffix readout.

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 normal-form existence direction is sourced to the reviewed classical result. The FPRD contribution is the exact contractive suffix representation carried by that finite presentation.

Open work

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

Notes

The normal-form existence direction is sourced to the reviewed classical result. The FPRD contribution is the exact contractive suffix representation carried by that finite presentation.