A note on the succinctness of descriptions of deterministic languages

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

It is shown that the relative succinctness that may be achieved by describing deterministic context-free languages by general unambiguous grammars rather than by deterministic pushdown automata is not bounded by any recursive function.

Cited by (0)