A family of languages having only finite-index grammars

https://doi.org/10.1016/S0019-9958(78)91015-XGet rights and content
Under an Elsevier user license
open archive

It is proved that every grammar for a bounded, context-free language has finite index.

Cited by (0)