Claim FPRD-T18

Exact statement

For every finite conventional context-free grammar G, nonterminal A, and input word w, the least relational suffix behavior of the canonical translation returns exactly the suffixes v for which A derives a terminal prefix x with w=xv; consequently complete-match observation of the translated start variable is exactly the classical language of G.

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 target is exact remaining-suffix and language adequacy. Derivations producing the same terminal prefix collapse to one suffix outcome; no parse-forest, ambiguity-multiplicity, efficiency, PEG, or C001 result is included.

Open work

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

Notes

The target is exact remaining-suffix and language adequacy. Derivations producing the same terminal prefix collapse to one suffix outcome; no parse-forest, ambiguity-multiplicity, efficiency, PEG, or C001 result is included.