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
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1964_155_1_a7/
LA  - ru
ID  - DAN_1964_155_1_a7
ER  -