FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T19

Claim FPRD-T19

Exact statement

The canonical labeled translation of every finite conventional context-free grammar generates an M12 compact relational recognition dynamic reconstructed from its finite reachable graph shadows, and the complete-match call observation at its distinguished initial state is exactly the grammar's classical language.

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 dynamic is canonical relative to the ordered labeled presentation, not to its generated language. This applies the M12 representation theorem and does not assert a pushdown, finite-dimensional, or literal semi-algebraic realization.

Open work

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

Notes

The dynamic is canonical relative to the ordered labeled presentation, not to its generated language. This applies the M12 representation theorem and does not assert a pushdown, finite-dimensional, or literal semi-algebraic realization.