Aĭzerman, M. A.; Gusev, L. A.; Rozonoèr, L. I.; Smirnova, I. M.; Tal’, A. A. Algorithmic unsolvability of the problem of recognition of recursive event representability by finite automata. (English. Russian original) Zbl 0112.35702 Autom. Remote Control 22, 646-652 (1961); translation from Avtom. Telemekh. 22, 748-755 (1961). Two theorems on the capability of finite automata are proved. They are known to everyone acquainted with the rudiments of regular events and algorithms. Reviewer: J. R. Büchi Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 68Q45 Formal languages and automata PDF BibTeX XML Cite \textit{M. A. Aĭzerman} et al., Autom. Remote Control 22, 646--652 (1961; Zbl 0112.35702); translation from Avtom. Telemekh. 22, 748--755 (1961) Full Text: MNR