Sheila Greibach. A new normal-form theorem for context-free phrase structure grammars. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 42–52 [Book Review]

Journal of Symbolic Logic 34 (4):658-658 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270888

Links

PhilArchive



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

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: Sheila Greibach, A New Normal-Form Theorem for Context-Free Phase Structure Grammars. [REVIEW]Rohit Parikh - 1969 - Journal of Symbolic Logic 34 (4):658-658.
Gaifman's theorem on categorial grammars revisited.Wojciech Buszkowski - 1988 - Studia Logica 47 (1):23 - 33.
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.
A descriptive characterisation of linear languages.Tore Langholm - 2006 - Journal of Logic, Language and Information 15 (3):233-250.
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. [REVIEW]D. Terence Langendoen - 1968 - Journal of Symbolic Logic 33 (2):301-302.
Algebraically complete semirings and Greibach normal form.Zoltán Ésik & Hans Leiß - 2005 - Annals of Pure and Applied Logic 133 (1-3):173-203.
Phrase structure grammars as indicative of uniquely human thoughts.Eran Asoulin - 2019 - Language Sciences 74:98-109.
Burkhart W. H.. Theorem minimization. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 259–263. [REVIEW]Raymond J. Nelson - 1953 - Journal of Symbolic Logic 18 (4):348-348.
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.
A direct proof of the equivalence of free categorial grammars and simple phrase structure grammars.Wojciech Zielonka - 1978 - Studia Logica 37 (1):41 - 57.
Deterministic Context Free Languages.Seymour Ginsburg & Sheila Greibach - 1968 - Journal of Symbolic Logic 33 (2):302-302.
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars.Sheila A. Greibach - 1967 - Journal of Symbolic Logic 32 (1):114-115.
The Unsolvability of the Recognition of Linear Context-free Languages.Sheila A. Greibach - 1971 - Journal of Symbolic Logic 36 (4):693-693.
On the expressive power of abstract categorial grammars: Representing context-free formalisms. [REVIEW]Philippe de Groote & Sylvain Pogodalla - 2004 - Journal of Logic, Language and Information 13 (4):421-438.
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.

Analytics

Added to PP
2016-06-30

Downloads
26 (#606,277)

6 months
10 (#261,437)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Rohit Parikh
CUNY Graduate Center

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references