Review: N. Chomsky, M. P. Schutzenberger, The Algebraic Theory of Context-Free Languages [Book Review]

Journal of Symbolic Logic 32 (3):388-389 (1967)
  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,164

External links

  • This entry has no external links. Add one.
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: M. P. Schutzenberger, On Context-Free Languages and Push-Down Automata. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):297-298.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
Review: M. P. Schutzenberger, On the Definition of a Family of Automata; M. P. Schutzenberger, Finite Counting Automata; M. P. Schutzenberger, Certain Elementary Families of Automata. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):296-297.
Chomsky's Other Revolution.Steven Robert Allen - unknown
Formal languages defined by the underlying structure of their words.J. P. Ressayre - 1988 - Journal of Symbolic Logic 53 (4):1009-1026.
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.
Restorations of punctured languages and similarity of languages.Gerhard Lischke - 2006 - Mathematical Logic Quarterly 52 (1):20-28.
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, The Mathematical Theory of Context Free Languages. [REVIEW]Andrzej Blikle - 1968 - Journal of Symbolic Logic 33 (2):300-301.
A descriptive characterisation of linear languages.Tore Langholm - 2006 - Journal of Logic, Language and Information 15 (3):233-250.
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.
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.
The Lambek calculus enriched with additional connectives.Makoto Kanazawa - 1992 - Journal of Logic, Language and Information 1 (2):141-171.
Review: Noam Chomsky, George A. Miller, Introduction to the Formal Analysis of Natural Languages; Noam Chomsky, Formal properties of Grammars; George A. Miller, Noam Chomsky, Finitary Models of Language Users. [REVIEW]Joseph S. Ullian - 1968 - Journal of Symbolic Logic 33 (2):299-300.

Analytics

Added to PP
2013-11-22

Downloads
3 (#1,644,941)

6 months
1 (#1,444,594)

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