Geodesic
Algorithmic unsolvability of the problem of completeness recognition for finite automata
Doklady Akademii Nauk, Tome 155 (1964) no. 1, pp. 35-37 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1964_155_1_a7,
     author = {M. I. Kratko},
     title = {Algorithmic unsolvability of the problem of completeness recognition for finite automata},
     journal = {Doklady Akademii Nauk},
     pages = {35--37},
     year = {1964},
     volume = {155},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1964_155_1_a7/}
}
TY  - JOUR
AU  - M. I. Kratko
TI  - Algorithmic unsolvability of the problem of completeness recognition for finite automata
JO  - Doklady Akademii Nauk
PY  - 1964
SP  - 35
EP  - 37
VL  - 155
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DAN_1964_155_1_a7/
LA  - ru
ID  - DAN_1964_155_1_a7
ER  - 
%0 Journal Article
%A M. I. Kratko
%T Algorithmic unsolvability of the problem of completeness recognition for finite automata
%J Doklady Akademii Nauk
%D 1964
%P 35-37
%V 155
%N 1
%U http://geodesic.mathdoc.fr/item/DAN_1964_155_1_a7/
%G ru
%F DAN_1964_155_1_a7
M. I. Kratko. Algorithmic unsolvability of the problem of completeness recognition for finite automata. Doklady Akademii Nauk, Tome 155 (1964) no. 1, pp. 35-37. http://geodesic.mathdoc.fr/item/DAN_1964_155_1_a7/