Sheila Greibach. A note on undecidable properties of formal languages. Mathematical systems theory, vol. 2 , pp. 1–6

Journal of Symbolic Logic 40 (2):245 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271921

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

My notes

Similar books and articles

Review: Sheila Greibach, A Note on Undecidable Properties of Formal Languages. [REVIEW]Joseph S. Ullian - 1975 - Journal of Symbolic Logic 40 (2):245-245.
A Note on Undecidable Properties of Formal Languages.Sheila Greibach - 1975 - Journal of Symbolic Logic 40 (2):245-245.
Greibach Sheila A.. A note on pushdown store automata and regular systems. Proceedings of the American Mathematical Society, vol. 18 , pp. 263–268. [REVIEW]Richard Stanley - 1968 - Journal of Symbolic Logic 33 (2):302-303.
A Note on Pushdown Store Automata and Regular Systems.Sheila A. Greibach - 1968 - Journal of Symbolic Logic 33 (2):302-303.
Review: Sheila A. Greibach, A Note on Pushdown Store Automata and Regular Systems. [REVIEW]Richard Stanley - 1968 - Journal of Symbolic Logic 33 (2):302-303.
On Undecidable Propositions of Formal Mathematical Systems .PostscriptumIntroductory Note to 1934.Martin Davis, Kurt Godel & Stephen C. Kleene - 1990 - Journal of Symbolic Logic 55 (1):347.
The Unsolvability of the Recognition of Linear Context-free Languages.Sheila A. Greibach - 1971 - Journal of Symbolic Logic 36 (4):693-693.
Deterministic Context Free Languages.Seymour Ginsburg & Sheila Greibach - 1968 - Journal of Symbolic Logic 33 (2):302-302.
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.
Review: Seymour Ginsburg, Sheila Greibach, Deterministic Context Free Languages. [REVIEW]Richard Stanley - 1968 - Journal of Symbolic Logic 33 (2):302-302.
The languages of artifical intelligence, the languages of metaphysics, and the languages of faith.Javier Leach - 2014 - Scientia et Fides 2 (1):81-98.
Algebraically complete semirings and Greibach normal form.Zoltán Ésik & Hans Leiß - 2005 - Annals of Pure and Applied Logic 133 (1-3):173-203.
The Metaformal System: Completing the Theory of Language.Christopher Langan - 2018 - Cosmos and History 14 (2):207-227.
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 mathematical theory of truth and an application to the regress problem.S. Heikkilä - forthcoming - Nonlinear Studies 22 (2).

Analytics

Added to PP
2016-06-30

Downloads
22 (#690,757)

6 months
5 (#629,136)

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