Voir la notice de l'article provenant de la source Math-Net.Ru
@article{FPM_2009_15_4_a1, author = {D. N. Zhuk}, title = {Cardinality of the set of all precomplete classes for definite automata}, journal = {Fundamentalʹna\^a i prikladna\^a matematika}, pages = {29--36}, publisher = {mathdoc}, volume = {15}, number = {4}, year = {2009}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/FPM_2009_15_4_a1/} }
D. N. Zhuk. Cardinality of the set of all precomplete classes for definite automata. Fundamentalʹnaâ i prikladnaâ matematika, Tome 15 (2009) no. 4, pp. 29-36. http://geodesic.mathdoc.fr/item/FPM_2009_15_4_a1/
[1] Buevich V. A., Klindukhova T. E., “Ob algoritmicheskoi nerazreshimosti zadach ob A-polnote i polnote dlya definitnykh ogranichenno-determinirovannykh funktsii”, Matematicheskie voprosy kibernetiki, 10, Nauka, M., 2001, 139–154
[2] Kratko M. I., “Algoritmicheskaya nerazreshimost problemy raspoznavaniya polnoty dlya konechnykh avtomatov”, DAN SSSR, 155:1 (1964), 35–37 | MR | Zbl
[3] Kudryavtsev V. B., “O moschnostyakh mnozhestv predpolnykh klassov nekotorykh funktsionalnykh sistem, svyazannykh s avtomatami”, DAN SSSR, 151:3 (1963), 493–496
[4] Kudryavtsev V. B., Alëshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, M., 1985 | MR | Zbl