Hostname: page-component-6bf8c574d5-vmclg Total loading time: 0 Render date: 2025-02-21T23:38:12.685Z Has data issue: false hasContentIssue false
  • English
  • Français

Sheila A. Greibach. The unsolvability of the recognition of linear context-free languages. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 582–587.

Review products

Sheila A. Greibach. The unsolvability of the recognition of linear context-free languages. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 582–587.

Published online by Cambridge University Press:  12 March 2014

Seymour Ginsburg
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 36 , Issue 4 , December 1971 , pp. 693
Copyright
Copyright © Association for Symbolic Logic 1972

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)