Context
A generalized Dyck prefix is summarized exactly by its unmatched opener stack unless an earlier mismatch or underflow has made acceptance impossible.
Definitions
- The state space is , where a word in lists unmatched opener types from bottom to top and is absorbing failure.
- For a live stack , ; set .
- If , its canonical completion is .
Hypotheses and scope
- There is at least one bracket type; the neutral alphabet may be empty.
- Closers must match the top opener type, and underflow or mismatch is irreversible.
Proof or evidence
The specification gives total symbol actions and an absorbing failure state. The associated proof identifies every word residual with exactly one future language K_s or K_bottom.
Verification notes
The state convention, execution order, failure behavior, canonical completion, and readout were reconciled with the M21 proof and closure audit.
Limitations
- This is the generalized Dyck model, not an arbitrary context-free language.
- The definition alone does not assert finite-state recognizability.
Notes
The exact carrier is presentation-independent for the selected generalized-Dyck language. Its depth-N shadows retain remaining-suffix observations through input length N; closers act naturally between adjacent grades rather than by choosing representatives of a tail class.