The Turing degree of the inherent ambiguity problem for context-free languages
- 30 June 1975
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1 (1) , 77-91
- https://doi.org/10.1016/0304-3975(75)90013-4
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A helpful result for proving inherent ambiguityTheory of Computing Systems, 1968
- Context-free languages and Turing machine computationsProceedings of Symposia in Applied Mathematics, 1967