Review: M. A. Aizerman, L. A. Gusev, L. I. Rozonoer, I. M. Smirnova, A. A. Tal, The algorithmic Insolubility of the Problem of Recognizing the Representability of recursive events in finite automata [Book Review]

Journal of Symbolic Logic 37 (2):410-411 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273004

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,925

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: M. A. Ajzerman, L. A. Gusev, L. I. Rozonoer, I. M. Smirnova, A. A. Tal, Logic, Automata, Algorithms. [REVIEW]Jiri Becvar - 1966 - Journal of Symbolic Logic 31 (1):109-111.
The algorithmic Insolubility of the Problem of Recognizing the Representability of recursive events in finite automata.M. A. Aizerman, L. A. Gusev, I. M. Smirnova & A. A. Tal - 1972 - Journal of Symbolic Logic 37 (2):410-411.
Review: Marc A. Aiserman, Leonid A. Gusev, Lev I. Rozonoer, Irina M. Smirnova, Aleksey A. Tal, George M. Kranc, Logic, Automata, and Algorithms. [REVIEW]Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (3):625-625.
Marc A. Aiserman, Leonid A. Gusev, Lev I. Rozonoer, Irina M. Smirnova, and Aleksey A. Tal. Logic, automata, and algorithms. Revised English translation of XXXI 109 by Scripta Technica, Inc., George M. Kranc, translation editor. Academic Press, New York and London1971, xii + 433 pp. - Mark Aronowitsch Aiserman, L. A. Gussew, L. I. Rosonoer, I. M. Smirnova, and A. A. Tal. Logik—Automaten—Algorithmen. Revised German translation of the same by Rudolf Herschel. R. Oldenbourg Verlag, Munich and Vienna1967, X + 431 pp. - M. A. Ajzerman, L. A. Gusev, L. I. Rozonoer, I. M. Smirnova, and A. A. Tal. Logika, automaty a algoritmy. Czech translation of the same by Jaroslav Volčik, Miroslav Mleziva, and Antonín Mykiska. Československá Akademie Věd, Prague1971, 407 pp. [REVIEW]Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (3):625.
Review: M. L. Minsky, J.E. McCarthy, C.E. Shannon, Some Universal Elements for Finite Automata. [REVIEW]Patrick C. Fischer - 1970 - Journal of Symbolic Logic 35 (3):480-481.
A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
Review: M. P. Schutzenberger, On the Definition of a Family of Automata; M. P. Schutzenberger, Finite Counting Automata; M. P. Schutzenberger, Certain Elementary Families of Automata. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):296-297.
Minsky M. L.. Some universal elements for finite automata. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 117–128. [REVIEW]Patrick C. Fischer - 1970 - Journal of Symbolic Logic 35 (3):480-481.

Analytics

Added to PP
2013-11-22

Downloads
39 (#551,431)

6 months
5 (#992,332)

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