|
|
|
Publications in Math-Net.Ru |
Citations |
|
2006 |
| 1. |
M. I. Kratko, “The problem of combining the elements of a computer system”, Sib. Zh. Ind. Mat., 9:2 (2006), 81–89   |
|
2001 |
| 2. |
M. I. Kratko, G. S. Plesnevich, “Fast Algorithm of Deduction Recognition for Monadic Logical Programs”, Avtomat. i Telemekh., 2001, no. 10, 91–102  ; Autom. Remote Control, 62:10 (2001), 1620–1631   |
|
1993 |
| 3. |
M. I. Kratko, A. N. Khruzin, “Unsolvability of certain problems in the theory of Rödding automata”, Dokl. Akad. Nauk, 329:4 (1993), 416–418 |
|
1977 |
| 4. |
M. I. Kratko, “A remark on an upper bound of the degree of information graphs”, Sibirsk. Mat. Zh., 18:5 (1977), 1192–1193 ; Siberian Math. J., 18:5 (1977), 847–848 |
2
|
|
1976 |
| 5. |
M. I. Kratko, “The number of switchings that are necessary for the unblocking of a three-step commutator”, Dokl. Akad. Nauk SSSR, 227:1 (1976), 54–56 |
|
1970 |
| 6. |
M. I. Kratko, “Informational graphs”, Sibirsk. Mat. Zh., 11:5 (1970), 1093–1097 ; Siberian Math. J., 11:5 (1970), 812–815 |
2
|
|
1965 |
| 7. |
M. I. Kratko, “On a certain class of Post calculi”, Dokl. Akad. Nauk SSSR, 165:5 (1965), 994–995 |
|
1964 |
| 8. |
M. I. Kratko, “On the existence of non-recursive bases of finite automata”, Algebra i Logika. Sem., 3:2 (1964), 33–44 |
| 9. |
M. I. Kratko, “Algorithmic unsolvability of the problem of completeness recognition for finite automata”, Dokl. Akad. Nauk SSSR, 155:1 (1964), 35–37 |
14
|
|
| Organisations |
|
| |
|
|
Contact us: