Seymour Ginsburg
Abstract
Four principal results about ambiguity in languages (i.e., context free languages) are proved. It is first shown that the problem of determining whether an arbitrary language is inherently ambiguous is recursively unsolvable. Then a decision procedure is presented for determining whether an arbitrary bounded grammar is ambiguous. Next, a necessary and sufficient algebraic condition is given for a bounded language to be inherently ambiguous. Finally, it is shown that no language contained in w1*w2*, each w1 a word, is inherently ambiguous.
- 1 BAR-HILLEEL, PERLES, AND SHAMIR. On forraal properties of simple phrase structure grammars. Z. Phonetik. Sprachwiss. Kommunikationsforsch. 14 (1961), 143-172.Google Scholar
- 2 CANTOR, D- On the ambiguity problem of Backus systems. J. ACM 9 (1962), 477-479. Google Scholar
- 3 CoisKr, N. On certain formal properties of grammars. Inform. Control. 2 (1959), 137- 167.Google Scholar
- 4 Three models for the description of language. IRE Trans. on Information Theory 2 (1956), 113-124.Google Scholar
- 5 AND SCHUTZENBERGER, M. P. The algebraic theory of context-free languages. In Computer Programming and Formal Systems, Braffort and Hirschberg (Eds.), North- Holland Publishing Co., Amsterdam, 1963.Google Scholar
- 6 EVEY, J. The theory and applications of pushdown store machines. Mathematical Linguistics and Automatic Translation, Rep. No. NSF-10, Comput. Lab., Harvard U., 1963.Google Scholar
- 7 GINSBURG, S., .ND RICE, i.G. Two families of languages related to ALGOL. J. ACM 9 (1962), 350-371. Google Scholar
- 8 --- AND ROSE, G.F. Operations which preserve definability in languages. J. ACM I0 (1963), 175-195. Google Scholar
- 9 --- kND SpANIEI, E.H. Bounded ALGOL-like languages. Trans. Amer. Math. ocl 113 (1964), 333-368.Google Scholar
- 10 --- AND . Semigroups, Presburger formulas, and languages. Pacific J. Math., to appear.Google Scholar
- 11 GaIBACR, S.A. Inverses of phrase structure generators. Mathematical Linguistics and Automatic Translation, Rep. No. NSF-11, Comput. Lab., Harvard U., 1963.Google Scholar
- 12 PARIKH, R. J. Language-generating devices. Quart. Prog. Rep. No. 60, Res. Lab. of Electronics, MIT, Jan. 1961, 199-212.Google Scholar
- 13 PosT, E.L. A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc. 52 (1946), 264-268.Google Scholar
- 14 RABIN, M., AND SCOTT, D. Finite automata and their decision problems. IBM J. Res. Develop. 3 (1959), 114-125.Google Scholar
- 15 SCHINBRO, S. Note on the Boolean properties of contex free languages. Infor. ContrS (1960), 372-375.Google Scholar
Index Terms
- Ambiguity in context free languages
Recommendations
Preservation of unambiguity and inherent ambiguity in context-free languages
Various elementary operations are studied to find whether they preserve on ambiguity and inherent ambiguity of language (“language” means “context-free language”) The following results are established:
- If L is an unambiguous language and S is a ...
Ambiguity in omega context free languages
We extend the well-known notions of ambiguity and of degrees of ambiguity of finitary context free languages to the case of omega context free languages ( -CFL) accepted by Büchi or Muller pushdown automata. We show that these notions may be defined ...
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages
Call a (context-free) language unambiguous if it is not inherently ambiguous. In the absence of evidence to the contrary, the suspicion has arisen that the unambiguous languages might be precisely those languages with context-free complements. The two ...
Comments