Review: Joseph S. Ullian, Partial Algorithm Problems for Context Free Languages [Book Review]

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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.
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: Joseph Ullian, Failure of a Conjecture about Context Free Languages. [REVIEW]D. Terence Langendoen - 1967 - Journal of Symbolic Logic 32 (2):266-267.
Review: Joseph Ullian, Bernard Baumrin, Mathematical Objects; Joseph S. Ullian, Is any Set Theory True? [REVIEW]Alonzo Church - 1975 - Journal of Symbolic Logic 40 (4):593-595.
Review: Sheila Greibach, A Note on Undecidable Properties of Formal Languages. [REVIEW]Joseph S. Ullian - 1975 - Journal of Symbolic Logic 40 (2):245-245.
Deductive parsing with sequentially indexed grammars.Jan van Eijck - unknown
Sequentially indexed grammars.Jan van Eijck - unknown
An Ç ´Ò¿ µ Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars.Dan Klein & Christopher D. Manning - unknown
Formal languages defined by the underlying structure of their words.J. P. Ressayre - 1988 - Journal of Symbolic Logic 53 (4):1009-1026.
Review: N. Chomsky, M. P. Schutzenberger, The Algebraic Theory of Context-Free Languages. [REVIEW]G. H. Matthews - 1967 - Journal of Symbolic Logic 32 (3):388-389.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
A descriptive characterisation of linear languages.Tore Langholm - 2006 - Journal of Logic, Language and Information 15 (3):233-250.
From predication to programming.Karel Lambert - 2001 - Minds and Machines 11 (2):257-265.
Squares of regular languages.Gerhard Lischke - 2005 - Mathematical Logic Quarterly 51 (3):299.
Review: P. M. Lewis, R. E. Stearns, J. Hartmanis, Memory Bounds for Recognition of Context-free and Context-Sensitive Languages. [REVIEW]Walter J. Savitch - 1972 - Journal of Symbolic Logic 37 (3):625-625.

Analytics

Added to PP
2013-11-22

Downloads
19 (#791,735)

6 months
3 (#974,323)

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