Small universal Turing machines Y Rogozhin Theoretical Computer Science 168 (2), 215-240, 1996 | 273 | 1996 |
Context-free insertion–deletion systems M Margenstern, G Păun, Y Rogozhin, S Verlan Theoretical computer science 330 (2), 339-348, 2005 | 96 | 2005 |
Graph-controlled insertion-deletion systems R Freund, M Kogler, Y Rogozhin, S Verlan arXiv preprint arXiv:1008.1651, 2010 | 54 | 2010 |
Computational power of symport/antiport: history, advances, and open problems A Alhazov, R Freund, Y Rogozhin International Workshop on Membrane Computing, 1-30, 2005 | 53 | 2005 |
Insertion-deletion systems with one-sided contexts A Matveevici, Y Rogozhin, S Verlan Machines, Computations, and Universality: 5th International Conference, MCU …, 2007 | 50 | 2007 |
A universal Turing machine with 3 states and 9 symbols M Kudlek, Y Rogozhin Developments in Language Theory: 5th International Conference, DLT 2001 Wien …, 2002 | 48 | 2002 |
Computational power of insertion–deletion (P) systems with rules of size two A Krassovitskiy, Y Rogozhin, S Verlan Natural Computing 10, 835-852, 2011 | 44 | 2011 |
On networks of evolutionary processors with nodes of two types A Alhazov, C Martín-Vide, B Truthe, J Dassow, Y Rogozhin Fundamenta Informaticae 91 (1), 1-15, 2009 | 41 | 2009 |
Further results on insertion-deletion systems with one-sided contexts A Krassovitskiy, Y Rogozhin, S Verlan Language and Automata Theory and Applications: Second International …, 2008 | 41 | 2008 |
Small universal circular post machines M Kudlek, R Yu Comput. Sci. J. Mold 9, 25, 2001 | 37 | 2001 |
P systems with minimal insertion and deletion A Alhazov, A Krassovitskiy, Y Rogozhin, S Verlan Theoretical Computer Science 412 (1-2), 136-144, 2011 | 36 | 2011 |
Communicative P systems with minimal cooperation A Alhazov, M Margenstern, V Rogozhin, Y Rogozhin, S Verlan Membrane Computing: 5th International Workshop, WMC 2004, Milan, Italy, June …, 2005 | 35 | 2005 |
Finite H-systems with 3 test tubes are not predictable L Priese, Y Rogozhin, M Margenstern Proceedings of Pacific Symposium on Biocomputing, Kapalua, Maui, 545-556, 1998 | 34 | 1998 |
On the rule complexity of universal tissue P systems Y Rogozhin, S Verlan Membrane Computing: 6th International Workshop, WMC 2005, Vienna, Austria …, 2006 | 33 | 2006 |
A universal Turing machine with 22 states and 2 symbols Y Rogozhin Romanian Journal of Information Science and Technology 1 (3), 259-265, 1998 | 33 | 1998 |
On the size of computationally complete hybrid networks of evolutionary processors A Alhazov, E Csuhaj-Varjú, C Martín-Vide, Y Rogozhin Theoretical Computer Science 410 (35), 3188-3197, 2009 | 32 | 2009 |
On the number of nodes in universal networks of evolutionary processors A Alhazov, C Martín-Vide, Y Rogozhin Acta Informatica 43, 331-339, 2006 | 32 | 2006 |
Seven universal Turing machines Y Rogozhin Math. Issled 69, 76-90, 1982 | 32 | 1982 |
Time-varying distributed H systems with parallel computations: the problem is solved M Margenstern, Y Rogozhin, S Verlan International Workshop on DNA-Based Computers, 48-54, 2003 | 27 | 2003 |
New small universal circular Post machines M Kudlek, Y Rogozhin Fundamentals of Computation Theory: 13th International Symposium, FCT 2001 …, 2001 | 26 | 2001 |