 |
| Degrees: | Dr. habil. | | Function: | Principal Researcher |
| Date of birth: | November 13, 1949 | | Publications: | 98 | | Foreign languages: | Russian, English, French | | Phone: | 72-74-83 | | Email: | |
|
Research interests
Mathematics, theoretical computer science, formal languages theory and its applications, biocomputing, nanotechnologies
Important publications
- Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes.
Artiom Alhazov, Yurii Rogozhin, Lecture Notes in Computer Science, Springer, vol. 4860 (2007) 97-112. - Insertion-Deletion Systems with One-Sided Contexts.
Artiom Matveevici, Yurii Rogozhin, Sergey Verlan, Lecture Notes in Computer Science, Springer, vol. 4664 (2007) 205-217. - Minimal Cooperation in Symport/antiport Tissue P Systems.
Artiom Alhazov, Yurii Rogozhin, Sergey Verlan, International Journal of Foundations of Computer Science, World Scientific, Volume 18, Number 1 (2007) 163-180. - On the number of nodes in universal networks of evolutionary processors.
Artiom Alhazov, Carlos Martín-Vide, Yurii Rogozhin, Acta Informatica, vol. 43(5) Springer (2006) 331-339. - Generating Languages by P Systems with Minimal Symport/Antiport.
A. Alhazov, Yu. Rogozhin, Computer Science Journal of Moldova, vol.14, 3(42) (2006) 299-323. - On the Rule Complexity of Universal Tissue P Systems.
Rogozhin, Yu., Verlan, S, Lecture Notes in Computer Science 3850 (2006) 356-362. - Towards a Characterization of P Systems with Minimal Symport/Antiport and Two membranes.
A.Alhazov, Yu.Rogozhin, Lecture Notes in Computer Science, Springer, 4361, (2006) 135 - 153. - Computational Power of Symport/Antiport: History, Advances, and Open Problems.
Alhazov, A., Freund, R., Rogozhin, Yu., Lecture Notes in Computer Science 3850 (2006) 1-30. - Context-free insertion-deletion systems.
Margenstern, M., Paun, G., Rogozhin, Yu., Verlan, S., Theoretical Computer Science, Elsevier, vol.330, issue 2 (2005) 339 - 348. - Communicative P Systems with Minimal Cooperation.
Alhazov, A., Margenstern, M., Rogozhin, V., Rogozhin, Yu., Verlan, S, Lecture Notes in Computer Science, Springer, vol.3365 (2005) 161 - 177. - Time-Varying Distributed H Systems: An Overview.
Margenstern, M., Verlan, S., Rogozhin, Yu., Fundamenta Informaticae, vol. 64 (2005) 291 - 306. - Some optimal results on symport/antiport P systems with minimal cooperation.
Alhazov, A., Freund, R., Rogozhin, Yu., Cellular Computing (Complexity aspects). ESF PESC Exploratory Workshop, Sevilla, Spain, January 31 – February 2 (2005) 23 - 36. - Symport/antiport tissue P systems with minimal cooperation.
Alhazov, A., Rogozhin, Yu., Verlan, S., Cellular Computing (Complexity aspects). ESF PESC Exploratory Workshop, Sevilla, Spain, January 31 – February 2 (2005) 37 - 52. - Time-varying distributed H systems with parallel computations: the problem is solved.
Margenstern, M., Rogozhin, Yu., Verlan, S., Lecture Notes in Computer Science, 2943 (2004) 48-53. - P Systems with Cutting/Recombination Rules Assigned to Membranes.
Freund F., Freund R., Oswald M., Margenstern M., Rogozhin Y., Verlan S., Lecture Notes in Computer Science, 2933 (2004) 191-202. - On the power of the (molecular) crowd: set-conditional string processing.
Margenstern, M., Păun, G., Rogozhin, Yu., Publicationes Mathematicae, Debrecen (Hungary), vol.65 (2004) 575 - 590. - Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations.
Margenstern, M., Rogozhin, Yu., Verlan, S., Lecture Notes in Computer Science, 2568 (2003) 326-336. - A universal time-varying distributed H system of degree 1.
Margenstern, M., Rogozhin Yu., Lecture Notes in Computer Science, 2340 (2002) 371-380. - Self-describing Turing machines.
Margenstern, M., Rogozhin, Yu., Fundamenta Informaticae, 50, no.3-4 (2002) 285-303. - Small universal Turing and circular Post machines.
Kudlek, M., Rogozhin, Yu., PU.M.A. Pure Mathematics and Applications, Budapest University of Economics, University of Siena, HU ISSN 1218-4586, 13, no.1-2 (2002) 197-210. - Nine Universal Circular Post Machines.
Alhazov, A., Kudlek, M., Rogozhin, Yu., Computer Science Journal of Moldova, 10, no.3 (2002) 247-262. - A Universal Turing Machine with 3 States and 9 symbols. Developments in Language Theory (W.Kuich, G.Rozenberg, A.Salomaa Eds.).
Kudlek M., Rogozhin Yu., Lecture Notes in Computer Science, 2295 (2002) 311-318. - Time-varying distributed H systems of degree 1 generate all recursively enumerable languages.
Margenstern, M., Rogozhin, Yu., Words, Semigroups, and Transductions, Festschrift in Honor of Gabriel Thierrin (ed. by Masami Ito, Gheorghe Paun, Sheng Yu), World Scientific (2001) 329-340. - Extended time-varying distributed H systems - Universality result.
Margenstern, M, Rogozhin, Yu., In Proceedings of the 5th World Multi-Conference on Systemics, Cybernetics and Informatics, Industrial systems, SCI 2001, Orlando, Florida, USA, July 22-25, 2001, vol. IX. - Time-varying distributed H systems of degree 2 generate all recursively enumerable languages.
Margenstern, M., Rogozhin, Yu., Where Mathematics, Computer Science, Linguistics and Biology Meet, Kluwer Academic publishers (2001) 399-407. - New small universal circular Post machines.
Kudlek, M., Rogozhin, Yu., In Proceedings of 13th International Symposium on Fundamentals of Computational Theory, FCT 2001, Riga, Latvia, August 22-24, 2001, Lecture Notes in Computer Science, 2138 (2001) 217-227. - Small Universal Circular Post Machines.
Kudlek, M., Rogozhin, Yu., Computer Science Journal of Moldova, 9, no.1 (2001) 34-52. - About time-varying distributed H systems.
Margenstern, M., Rogozhin, Yu., DNA Computing, 6th International Workshop on DNA-based Computers, DNA 2000, Leiden, The Netherlands, June 13-17, 2000, Lecture Notes in Computer Science, 2054 (2001) 53-62. - A universal time-varying distributed H-system of degree 2.
Margenstern, M., Rogozhin, Yu., Biosystems, Elsevier, 52 (1999) 73-80. - Some small self-describing Turing machines.
Margenstern, M., Rogozhin, Yu., Computer Science Journal of Moldova, 6, no.1 (1998) 57-82. - Finite H-systems with 3 Test Tubes are not Predictable.
Priese, L., Rogozhin, Y., Margenstern, M., In Proceedings of Pacific Simposium on Biocomputing, 3, Kapalua, Maui, January 1998, Hawaii, USA (R.Altman, A.Dunker, L.Hanter, T.Klein eds.), World Sci.Publ., Singapure (1998) 545-556. - A universal Turing machine with 22 states and 2 symbols.
Rogozhin, Yu., Romanian Journal of Information Science and Technology, vol. 1, no.3 (1998) 259-265. - Small Universal Turing Machines.
Rogozhin, Yu., Theoretical Computer Science, Elsevier, 168-2 (1996) 215-240.
Membership in Societies and Editorial Boards
- European Association for Theoretical Computer Science (EATCS).
- European Molecular Computer Consortium (EMCC).
- Mathematical Society of the Republic of Moldova.
Activity
Academy of Sciences of Moldova, Institute of Mathematics and Computer Science, Scientific Council for defended of the PhD thesis in computer science, chief of the Council.
Publications in Computer Science Journal of Moldova, Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica and Quasigroups and Related Systems
