Succinctness of Descriptions of Unambiguous Context-Free Languages
- 1 September 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (3) , 547-553
- https://doi.org/10.1137/0206039
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A note on the succinctness of descriptions of deterministic languagesInformation and Control, 1976
- A helpful result for proving inherent ambiguityTheory of Computing Systems, 1968
- A regularity test for pushdown machinesInformation and Control, 1967
- Context-free languages and Turing machine computationsProceedings of Symposia in Applied Mathematics, 1967