The algorithmic Insolubility of the Problem of Recognizing...

The algorithmic Insolubility of the Problem of Recognizing the Representability of recursive events in finite automata.by M. A. Aizerman; L. A. Gusev; L. I. Rozonoér; I. M. Smirnova; A. A. Tal

Review by: Joseph S. Ullian
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
37
Language:
english
Journal:
The Journal of Symbolic Logic
DOI:
10.2307/2273004
Date:
June, 1972
File:
PDF, 205 KB
english, 1972
Conversion to is in progress
Conversion to is failed