|
|
|
Publications in Math-Net.Ru |
Citations |
|
2015 |
| 1. |
R. I. Podlovchenko, “Finite state automata in the theory of algebraic program schemata”, Proceedings of ISP RAS, 27:2 (2015), 161–172   |
|
2014 |
| 2. |
R. I. Podlovchenko, “Primitive Program Schemes with Procedures”, Model. Anal. Inform. Sist., 21:4 (2014), 116–131 |
1
|
| 3. |
R. I. Podlovchenko, A. E. Molchanov, “Equivalence Problem Solvability in Gateway Program Models”, Model. Anal. Inform. Sist., 21:2 (2014), 56–70 |
2
|
|
2012 |
| 4. |
R. I. Podlovchenko, A. E. Molchanov, “About Algebraic Program Models with Procedures”, Model. Anal. Inform. Sist., 19:5 (2012), 100–114 |
4
|
|
2010 |
| 5. |
R. I. Podlovchenko, V. E. Khachatryan, “A complete solution of the minimisation problem for a set of binary two-tape automata”, Diskr. Mat., 22:3 (2010), 146–159  ; Discrete Math. Appl., 20:4 (2010), 451–466  |
|
2009 |
| 6. |
R. I. Podlovchenko, N. N. Kuzyurin, V. S. Shcherbina, V. A. Zakharov, “Using algebraic models of programs for detecting metamorphic malwares”, Fundam. Prikl. Mat., 15:5 (2009), 181–198 ; J. Math. Sci., 172:5 (2011), 740–750 |
|
2008 |
| 7. |
R. I. Podlovchenko, V. E. Khachatryan, “Minimality and deadlockness of multitape automata”, Diskr. Mat., 20:2 (2008), 100–121  ; Discrete Math. Appl., 18:3 (2008), 271–292 |
3
|
|
1994 |
| 8. |
R. I. Podlovchenko, “Solvability of the problem of equivalent transformations in
special automaton models of recursive programs”, Dokl. Akad. Nauk, 337:5 (1994), 577–580 ; Dokl. Math., 50:1 (1995), 132–136 |
|
1973 |
| 9. |
R. I. Podlovchenko, “A complete system of similarity transformations of nondeterministic algorithm schemes”, Dokl. Akad. Nauk SSSR, 212:1 (1973), 64–66 |
|
1972 |
| 10. |
R. I. Podlovchenko, “Nondeterminate algorithm schemes”, Dokl. Akad. Nauk SSSR, 207:4 (1972), 789–792 |
|
1960 |
| 11. |
R. I. Podlovchenko, “A system of programming concepts”, Dokl. Akad. Nauk SSSR, 132:6 (1960), 1287–1290 |
1
|
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: