Information and ControlVolume 32, Issue 2, October 1976, Pages 139-145Information and Cont...A note on the succinctness of descriptions of deterministic languagesAuthor links open overlay panelLeslie G. ValiantShow moreShareCitehttps://doi.org/10.1016/S0019-9958(76)90173-XGet rights and contentUnder an Elsevier user licenseopen archiveIt 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.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1976 Published by Elsevier Inc.