About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of the ACM
Paper
A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets
Abstract
An investigation is made of certain quantitative and qualitative aspects of inherent ambiguity of context-free languages. Two main results are proved. The first asserts that for every integer k there are inherently k-ambiguous context-free subsets of a*b*c*. This result is obtained as a corollary of a more general result concerning ambiguous presentations of semilinear sets. The second result asserts that inherent ambiguity can arise from the “nesting” property of context-free languages, as well as from the “pairwise matching” property. © 1970, ACM. All rights reserved.