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)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273004
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,474
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Logic, Automata, Algorithms.L. I. Rozonoer & I. M. Smirnova - 1966 - Journal of Symbolic Logic 31 (1):109-111.
Undecidability of Representability as Binary Relations.Robin Hirsch & Marcel Jackson - 2012 - Journal of Symbolic Logic 77 (4):1211-1244.
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
:Recursive Arithmetic of Words and Finite Automata.[author unknown] - 1971 - Journal of Symbolic Logic 36 (3):549-550.
Arithmetic of Divisibility in Finite Models.A. E. Wasilewska & M. Mostowski - 2004 - Mathematical Logic Quarterly 50 (2):169.

Analytics

Added to PP index
2013-11-22

Total views
23 ( #383,670 of 2,273,318 )

Recent downloads (6 months)
2 ( #561,669 of 2,273,318 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature