FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T29

Claim FPRD-T29

Exact statement

For every nonempty finite output alphabet Sigma there are one finite generalized Dyck alphabet and one fixed letter-to-letter readout, depending only on Sigma, such that the exact suffix behaviors of context-free languages over Sigma are precisely the decoded observations obtained by varying a finite regular controller; every such observation is coherently reconstructed from the controller-product's finite shadows.

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 fixed-alphabet non-erasing Chomsky-Schützenberger existence theorem is sourced to Crespi Reghizzi and San Pietro. M18 supplies its exact suffix and bounded-observation recognition lift.

Open work

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

Notes

The fixed-alphabet non-erasing Chomsky-Schützenberger existence theorem is sourced to Crespi Reghizzi and San Pietro. M18 supplies its exact suffix and bounded-observation recognition lift.