Kratko Miroslav Ivanovich

Publications in Math-Net.Ru

1. The problem of combining the elements of a computer system
   
   Sib. Zh. Ind. Mat., 9:2 (2006),  81–89
2. Fast Algorithm of Deduction Recognition for Monadic Logical Programs
   
   Avtomat. i Telemekh., 2001, no. 10,  91–102
3. Unsolvability of certain problems in the theory of Rödding automata
   
   Dokl. Akad. Nauk, 329:4 (1993),  416–418
4. A remark on an upper bound of the degree of information graphs
   
   Sibirsk. Mat. Zh., 18:5 (1977),  1192–1193
5. The number of switchings that are necessary for the unblocking of a three-step commutator
   
   Dokl. Akad. Nauk SSSR, 227:1 (1976),  54–56
6. Informational graphs
   
   Sibirsk. Mat. Zh., 11:5 (1970),  1093–1097
7. On a certain class of Post calculi
   
   Dokl. Akad. Nauk SSSR, 165:5 (1965),  994–995
8. On the existence of non-recursive bases of finite automata
   
   Algebra i Logika. Sem., 3:2 (1964),  33–44
9. Algorithmic unsolvability of the problem of completeness recognition for finite automata
   
   Dokl. Akad. Nauk SSSR, 155:1 (1964),  35–37