Seymour Ginsburg, Thomas N. Hibbard, and Joseph S. Ullian. Sequences in context free languages. Illinois journal of mathematics, vol. 9 , pp. 321–337 [Book Review]

Journal of Symbolic Logic 37 (1):197 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272614

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

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, Thomas N. Hibbard, Joseph S. Ullian, Sequences in Context Free Languages. [REVIEW]G. H. Matthews - 1972 - Journal of Symbolic Logic 37 (1):197-197.
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.
Ambiguity in Context Free Languages.Seymour Ginsburg, Joseph Ullian & Thomas N. Hibbard - 1968 - Journal of Symbolic Logic 33 (2):301-302.
The Mathematical Theory of Context Free Languages.Seymour Ginsburg - 1968 - Journal of Symbolic Logic 33 (2):300-301.
Quotients of Context-Free Languages.Seymour Ginsburg & Edwin H. Spanier - 1969 - Journal of Symbolic Logic 34 (1):135-136.
Deterministic Context Free Languages.Seymour Ginsburg & Sheila Greibach - 1968 - Journal of Symbolic Logic 33 (2):302-302.
Review: Seymour Ginsburg, The Mathematical Theory of Context Free Languages. [REVIEW]Andrzej Blikle - 1968 - Journal of Symbolic Logic 33 (2):300-301.
Review: Seymour Ginsburg, Edwin H. Spanier, Quotients of Context-Free Languages. [REVIEW]Asa Kasher - 1969 - Journal of Symbolic Logic 34 (1):135-136.
Review: Joseph S. Ullian, Partial Algorithm Problems for Context Free Languages. [REVIEW]G. H. Matthews - 1972 - Journal of Symbolic Logic 37 (1):196-197.
Review: Seymour Ginsburg, Sheila Greibach, Deterministic Context Free Languages. [REVIEW]Richard Stanley - 1968 - Journal of Symbolic Logic 33 (2):302-302.
Review: Sheila A. Greibach, The Unsolvability of the Recognition of Linear Context-free Languages. [REVIEW]Seymour Ginsburg - 1971 - Journal of Symbolic Logic 36 (4):693-693.
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.
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.
Failure of a Conjecture about Context Free Languages.Joseph Ullian - 1967 - Journal of Symbolic Logic 32 (2):266-267.
Review: Joseph Ullian, Failure of a Conjecture about Context Free Languages. [REVIEW]D. Terence Langendoen - 1967 - Journal of Symbolic Logic 32 (2):266-267.

Analytics

Added to PP
2016-06-30

Downloads
26 (#610,229)

6 months
2 (#1,196,523)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references