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
Ullian, Joseph S.
J. Symbolic Logic, Tome 37 (1972) no. 1, p. 410-411 / Harvested from Project Euclid
Publié le : 1972-06-14
Classification: 
@article{1183738257,
     author = {Ullian, Joseph S.},
     title = {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},
     journal = {J. Symbolic Logic},
     volume = {37},
     number = {1},
     year = {1972},
     pages = { 410-411},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183738257}
}
Ullian, Joseph S. 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. J. Symbolic Logic, Tome 37 (1972) no. 1, pp.  410-411. http://gdmltest.u-ga.fr/item/1183738257/