The Unsolvability of the Recognition of Linear Context-free Languages

Journal of Symbolic Logic 36 (4):693-693 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A descriptive characterisation of linear languages.Tore Langholm - 2006 - Journal of Logic, Language and Information 15 (3):233-250.
Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
Deterministic Context Free Languages.Seymour Ginsburg & Sheila Greibach - 1968 - Journal of Symbolic Logic 33 (2):302-302.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
Squares of regular languages.Gerhard Lischke - 2005 - Mathematical Logic Quarterly 51 (3):299.
On the Effect of the IO-Substitution on the Parikh Image of Semilinear Full AFLs.Pierre Bourreau - 2015 - Journal of Logic, Language and Information 24 (1):1-26.

Analytics

Added to PP
2015-02-05

Downloads
1 (#1,886,728)

6 months
1 (#1,510,037)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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