Fundamentalʹnaâ i prikladnaâ matematika, Tome 15 (2009) no. 4, pp. 29-36
Citer cet article
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/
@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},
year = {2009},
volume = {15},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2009_15_4_a1/}
}
TY - JOUR
AU - D. N. Zhuk
TI - Cardinality of the set of all precomplete classes for definite automata
JO - Fundamentalʹnaâ i prikladnaâ matematika
PY - 2009
SP - 29
EP - 36
VL - 15
IS - 4
UR - http://geodesic.mathdoc.fr/item/FPM_2009_15_4_a1/
LA - ru
ID - FPM_2009_15_4_a1
ER -
%0 Journal Article
%A D. N. Zhuk
%T Cardinality of the set of all precomplete classes for definite automata
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2009
%P 29-36
%V 15
%N 4
%U http://geodesic.mathdoc.fr/item/FPM_2009_15_4_a1/
%G ru
%F 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