Seymour Ginsburg and Joseph Ullian. Ambiguity in context free languages. Journal of the Association for Computing Machinery, vol. 13 , pp. 62–89. - Seymour Ginsburg and Joseph Ullian. Preservation of unambiguity and inherent ambiguity in context-free languages.Journal of the Association for Computing Machinery, vol. 13 , pp. 364–368. - Thomas N. Hibbard and Joseph Ullian, The independence of inherent ambiguity from complementedness among context-free languages. Journal of the Association for Computing Machinery, vol. 13 , pp. 588–593 [Book Review]

Journal of Symbolic Logic 33 (2):301-302 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269906

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Seymour Ginsburg, Joseph Ullian, Ambiguity in Context Free Languages; Seymour Ginsburg, Joseph Ullian, Preservation of Unambiguity and Inherent Ambiguity in Context-Free; Thomas N. Hibbard, Joseph Ullian, The Independence of Inherent Ambiguity from Complementednes Among Context-Free Languages. [REVIEW]D. Terence Langendoen - 1968 - Journal of Symbolic Logic 33 (2):301-302.
Seymour Ginsburg, Thomas N. Hibbard, and Joseph S. Ullian. Sequences in context free languages. Illinois journal of mathematics, vol. 9 , pp. 321–337. [REVIEW]G. H. Matthews - 1972 - Journal of Symbolic Logic 37 (1):197.
Review: Seymour Ginsburg, Thomas N. Hibbard, Joseph S. Ullian, Sequences in Context Free Languages. [REVIEW]G. H. Matthews - 1972 - Journal of Symbolic Logic 37 (1):197-197.
Seymour Ginsburg and Edwin H. Spanier. Quotients of context-free languages. Journal of the Association for Computing Machinery, vol. 10 , pp. 487–492. [REVIEW]Asa Kasher - 1969 - Journal of Symbolic Logic 34 (1):135-136.
Greibach Sheila A.. The unsolvability of the recognition of linear context-free languages. Journal of the Association for Computing Machinery, vol. 13 , pp. 582–587. [REVIEW]Seymour Ginsburg - 1971 - Journal of Symbolic Logic 36 (4):693-693.
Seymour Ginsburg and H. Gordon Rice. Two families of languages related to ALGOL. Journal of the Association for Computing Machinery, vol. 9 , pp. 350–371. [REVIEW]Asa Kasher - 1969 - Journal of Symbolic Logic 34 (1):135.
Joseph Ullian. Failure of a conjecture about context free languages. Information and control, vol. 9 , pp. 61–65.D. Terence Langendoen - 1967 - Journal of Symbolic Logic 32 (2):266-267.
Joseph S. Ullian. Partial algorithm problems for context free languages. Information and control, vol. 11 , pp. 80–101.G. H. Matthews - 1972 - Journal of Symbolic Logic 37 (1):196-197.
Wang Hao. Tag systems and lag systems. Mathematische Annalen, vol. 152 , pp. 65–74.Cocke John and Minsky Marvin. Universality of tag systems with D = 2. Journal of the Association for Computing Machinery, vol. 11 , pp. 15–20.Cook Stephen A.. The solvability of the derivability problem for one-normal systems. Journal of the Association for Computing Machinery, vol. 13 , pp. 223–225. [REVIEW]Ann Yasuhara - 1971 - Journal of Symbolic Logic 36 (2):344.
Seymour Ginsburg and Sheila Greibach. Deterministic context free languages. Informarion and control, vol. 9 , pp. 620–648. [REVIEW]Richard Stanley - 1968 - Journal of Symbolic Logic 33 (2):302.

Analytics

Added to PP
2016-06-30

Downloads
12 (#317,170)

6 months
4 (#1,635,958)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

D. Terence Langendoen
University of Arizona

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references