Claim FPRD-D13

Exact statement

A finite Greibach recognition presentation is the canonical labeled relational translation of a finite context-free grammar whose productions have the form A to terminal-a followed by a finite word of nonterminals, or A to epsilon; it retains the finite language and suffix equation operators, labeled call-context actions, bounded restrictions, and remaining-suffix and complete-match readouts.

Statusdefinition

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 docs/specs/m16-greibach-recognition-dynamics.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

docs/specs/m16-greibach-recognition-dynamics.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 definition retains semantic iteration and labeled continuation actions as related structures of one presentation. Contractiveness, adequacy, and the context-free characterization are theorem obligations.

Open work

Add a self-contained definition page with examples, nonexamples, and dependency boundaries.

Notes

The definition retains semantic iteration and labeled continuation actions as related structures of one presentation. Contractiveness, adequacy, and the context-free characterization are theorem obligations.