Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-19T03:59:26.513Z Has data issue: false hasContentIssue false
  • English
  • Français

M. A. Aizerman, L. A. Gusev, L. I. Rozonoér, I. M. Smirnova, and A. A. Tal'. The algorithmic insolubility of the problem of recognizing the representability of recursive events in finite automata. English translation of XXXVII 426. Automation and remote control, vol. 22 (1961), pp. 646–652.

Published online by Cambridge University Press:  12 March 2014

Joseph S. Ullian
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 37 , Issue 2 , June 1972 , pp. 410 - 411
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.)