proposition

Proposition 19.12

Finite completion-summary saturation

Proposition 19.12 (Finite completion-summary saturation). For every controlled-Dyck language, ηD(L)\eta_D(L) is exactly computable from any finite controller presentation by a terminating finite saturation.