Sheila A. Greibach. The undecidability of the ambiguity problem for minimal linear grammars. Information and control, vol. 6 , pp. 119–125 [Book Review]

Journal of Symbolic Logic 32 (1):114-115 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271262

Links

PhilArchive



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

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

The Undecidability of the Ambiguity Problem for Minimal Linear Grammars.Sheila A. Greibach - 1967 - Journal of Symbolic Logic 32 (1):114-115.
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.
A descriptive characterisation of linear languages.Tore Langholm - 2006 - Journal of Logic, Language and Information 15 (3):233-250.
The Unsolvability of the Recognition of Linear Context-free Languages.Sheila A. Greibach - 1971 - Journal of Symbolic Logic 36 (4):693-693.
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. [REVIEW]Rohit Parikh - 1970 - Journal of Symbolic Logic 34 (4):658-658.
On the membership problem for non-linear abstract categorial grammars.Sylvain Salvati - 2010 - Journal of Logic, Language and Information 19 (2):163-183.
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.
Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
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.
A note on the undecidability of the reachability problem for o‐minimal dynamical systems.Thomas Brihaye - 2006 - Mathematical Logic Quarterly 52 (2):165-170.
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 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.
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars.Stephan Kepser & Jim Rogers - 2011 - Journal of Logic, Language and Information 20 (3):361-384.
Matthews G. H.. Discontinuity and asymmetry in phrase structure grammars. Information and control, vol. 6 , pp. 137–146.Matthews G. H.. A note on asymmetry in phrase structure grammars. Information and control, vol. 7 , pp. 360–365. [REVIEW]Eliahu Shamir - 1970 - Journal of Symbolic Logic 35 (3):470-470.
Gaifman's theorem on categorial grammars revisited.Wojciech Buszkowski - 1988 - Studia Logica 47 (1):23 - 33.

Analytics

Added to PP
2013-11-22

Downloads
23 (#641,102)

6 months
3 (#880,460)

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