Dr. Sherzod Turaev

Associate Professor
Department of Computer Science & Software Engineering, College of Information Technology, United Arab Emirates University, Al Ain, Abu Dhabi, United Arab Emirates


Highest Degree
Ph.D. in Computer Science from Rovira I Virgili Univesrsity, Tarragona, Spain

Share this Profile

Area of Interest:

Computer Sciences
Formal Languages
Context-Free Grammars
Tree Controlled
Automata

Selected Publications

  1. Turaev, S., R. Karimnia and G. Khaleel, 2018. New cryptosystem based on permutation matrix. Int. J. Percept. Cognit. Comput., 4: 19-25.

  2. Turaev, S., G. Mavlankulov, M. Othman, M.H. Selamat, L. Zhumabayeva and T. Zhukabayeva, 2018. Concurrently controlled grammars. Kybernetika, 54: 748-764.

  3. Turaev, S., A.A.H. Abdelrahim, G.S. Mahmoud and A. Messikh, 2018. Implementation of quantum rotation gates using controlled non-adiabatic evolutions. Int. J. Nuclear Quantum Eng., 12: 12-16.

  4. Turaev, S., 2018. Towards a unified theory of regulated grammars. Triangle, 8: 137-152.

  5. Swidan, M.B., A.A. Alwan, S. Turaev and Y. Gulzar, 2018. A model for processing skyline queries in crowd-sourced databases. Indonesian J. Elect. Eng. Comput. Sci., 10: 798-806.
    Direct Link  |  

  6. Rahman, A.A., W.H. Fong, N.H. Sarmin, S. Turaev and N.L.M. Zulkufli, 2018. Static watson-crick regular grammar. Malaysian J. Fundam. Applied Sci., 14: 457-462.
    Direct Link  |  

  7. Mohamad Zulkufli, N.L., S. Turaev, M.I.M. Tamrin and A. Messikh, 2018. Watson-crick context-free grammars: Grammar simplifications and a parsing algorithm. Comput. J., 61: 1361-1373.
    CrossRef  |  Direct Link  |  

  8. Abdulghafor, R., S.S. Abdullah, S. Turaev, A. Zeki and I. Al-Shaikhli, 2018. Linear and nonlinear stochastic distribution for consensus problem in multi-agent systems. Neural Comput. Applic., 10.1007/s00521-018-3615-x.
    CrossRef  |  Direct Link  |  

  9. Abdulghafor, R., S.S. Abdullah, S. Turaev and M. Othman, 2018. An overview of the consensus problem in the control of multi-agent systems. Automatika, 59: 143-157.
    CrossRef  |  Direct Link  |  

  10. Abdulghafor, R., S. Turaev, A. Zeki and I. Al-Shaikhli, 2018. Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators. Int. J. Control, 91: 1431-1459.
    CrossRef  |  Direct Link  |  

  11. Abdulghafor, R., S. Turaev, A. Zeki and A. Abubaker, 2018. Nonlinear convergence algorithm: Structural properties with doubly stochastic quadratic operators for multi-agent systems. J. Artif. Intelli. Soft Comput. Res., 8: 49-61.
    Direct Link  |  

  12. Abdulghafor, R. and S. Turaev, 2018. Consensus of fractional nonlinear dynamics stochastic operators for multi-agent systems. Infor. Fusion, 44: 1-21.
    CrossRef  |  Direct Link  |  

  13. Yosman, A.F., M. Holzer, B. Truthe, F.W. Heng and S. Turaev, 2017. On bonded Indian and uniformly parallel insertion systems and their generative power. Malaysian J. Fundam. Applied Sci., 13: 769-773.
    Direct Link  |  

  14. Turaevc, S., S. Ashaari, A. Okhunov, M.I. Mohd Tamrin and T. Zhukabayeva, 2017. Closure properties of multiset controlled grammars. Indonesian J. Elect. Eng. Comput. Sci., 8: 36-42.

  15. Turaevc, S. and J. Dassow, 2017. Petri net controlled grammars: The power of labeling and final markings. Roman. J. Infor. Sci. Technol., 12: 191-207.

  16. Turaev, S., R. Abdulghafor and A. Zeki, 2017. Nonlinear Stochastic Operators to Control the Consensus Problem in Multi-agent Systems. IIUM Press, Malaysia.

  17. Turaev, S., I.F. Khaleel, Al-Shaikhli and M.I.M. Tamrin, 2017. Symmetric Cryptosystems Based on Finite Automata. IIUM Press, Malaysia.

  18. Turaev, S. and N.L.M. Zulkufli, 2017. DNA Computing Model: Watson-Crick Grammars. IIUM Press, Malaysia.

  19. Khaleel, G., S. Turaev, I.F.T. Alshaikhli, T. Zhukabayeva, M. Tamrin and M. Izzuddin, 2017. A symmetric cryptosystem based on nondeterministic finite automata. J. Theor. Applied Inform. Technol., 95: 1489-1498.
    Direct Link  |  

  20. Khaleel, G., I. Al- Shaikhli and M.I. Mohd Tamrin, 2017. A comparative performance analysis of modified d¨om¨osi’s cryptosystem and data encryption standard. Int. J. Perceptive Cognit. Comput., 3: 11-14.

  21. Jan, N.M., S. Turaev, W.H. Fong and N.H. Sarmin, 2017. Place-labeled petri net controlled grammars. ScienceAsia, 43: 9-19.

  22. Jan, N.M., F.W. Heng, N.H. Sarmin and S. Turaev, 2017. State machine of place-labelled petri net controlled grammars. Malaysian J. Fundam. Applied Sci., 13: 649-653.
    Direct Link  |  

  23. Gana, Y.S., W.H. Fongb, N.H. Sarminb and S. Turaevc, 2017. Generative capacity of sticker systems with the presence of weights. ScienceAsia, 43: 35-42.
    Direct Link  |  

  24. Fonga, W.H., Y.S. Ganb, N.H. Sarmina and S. Turaevc, 2017. Variants of weighted sticker systems with different weighting spaces. Scienceasia, 43: 43-51.
    Direct Link  |  

  25. Ashaari, S., S.R. Turaev and A. Okhunov, 2017. Tree valence controlled grammars. Int. J. Perceptive Cognit. Comput., 3: 15-22.
    Direct Link  |  

  26. Abdulghafor, R., S.R. Turaev, A. Zeki and I. Al-Shaikhli, 2017. Reach a nonlinear consensus for mas via doubly stochastic quadratic operators. Int. J. Control, 10.1080/00207179.2017.1318331.
    CrossRef  |  Direct Link  |  

  27. Zulkufli, N.L.M., S. Turaev, M.I.M. Tamrin and A. Messikh, 2016. The Computational Power of Watson-Crick Grammars: Revisited. Bio-inspired Computing-Theories and Applications. Communications in Computer and Information Science, In: International Conference on Bio-Inspired Computing: Theories and Applications, Zulkufli, N.L.M., S. Turaev, M.I.M. Tamrin and A. Messikh (Eds.)., Springer, Singapore, pp: 215-225.

  28. Zulkufli, N.L.M., S. Turaev, M.I.M. Tamrin and A. Messikh, 2016. Generative power and closure properties of watson-crick grammars. Applied Comput. Intelli. Soft Comput., Vol. 2016. .
    Direct Link  |  

  29. Shafriezal, M., M. Kasim, A.S. Razalai, G. Khaleel and S. Turaev, 2016. A new symmetric cryptosystem based on of permutation matrices. Int. J. Percept. Cognit. Comput., 2: 36-40.

  30. Mavlankulov, G., L. Zhumabayeva, M. Othman, T. Zhukabayeva, M.H. Selamat and S. Turaev, 2016. Context-free petri net controlled grammars under parallel firing strategy. Applied Math., 10: 1757-1762.

  31. Khaleel, G., S. Turaev, M. Tamrin, M. Izzuddin and I.F.T. Alshaikhli, 2016. Performance and security improvements of Domosi's cryptosystem. Int. J. Applied Math. Stat., 55: 32-45.
    Direct Link  |  

  32. Khaleel, G., S. Turaev, M. Tamrin, M. Izzuddin and I.F.T. Alshaikhli, 2016. A new block cipher based on finite automata systems. Int. J. Percept. Cognit. Comput., 2: 23-26.
    Direct Link  |  

  33. Khaleel, G., S. Turaev, I.F.T. Alshaikhli, M. Tamrin and M. Izzuddin, 2016. An overview of cryptosystems based on finite automata. J. Adv. Rev. Scient. Res., 27: 1-7.
    Direct Link  |  

  34. Jan, N.M., S. Turaev, W.H. Fong and N.H. Sarmin, 2016. Place-labeled petri net controlled grammars. ScienceAsia (In Press). .
    Direct Link  |  

  35. Gan, Y.S., W.H. Fong, N.H. Sarmin and S. Turaev, 2016. Generative capacity of sticker systems with the presence of weights. ScienceAsia (In Press). .
    Direct Link  |  

  36. Ashaari, S., S. Turaev and A. Okhunov, 2016. Structurally and arithmetically controlled grammars. Int. J. Percept. Cognit. Comput., 2: 25-35.
    Direct Link  |  

  37. Abdulghafor, R., S. Turaev, M. Tamrin and M. Izzuddin, 2016. Nonlinear consensus for multi-agent systems using positive intractions of doubly stochastic quadratic operators. Int. J. Percept. Cognit. Comput., 2: 19-22.

  38. Abdulghafor, R., F. Shahidi, A. Zeki and S. Turaev, 2016. Dynamics of doubly stochastic quadratic operators on a finite-dimensional simplex. Open Math., 14: 509-519.

  39. Abdulghafor, R., F. Shahidi, A. Zeki and S. Turaev, 2016. Dynamics Classifications of Extreme Doubly Stochastic Quadratic Operators on 2D Simplex. In: Advanced Computer and Communication Engineering Technology, Rahim, Y.A. and N.C. Pee (Eds.)., Springer, Singapore, pp: 323-335.

  40. Selvarajoo, M., W.H. Fong, N.H. Sarmin and S. Turaev, 2015. Computational Po wer of probabilistic bidirectional sticker system in DNA computing. Int. J. Applied Math. Stat., 53: 66-72.
    Direct Link  |  

  41. Selvarajoo, M., S. Turaev, W.H. Fong and N.H. Sarmin, 2015. The generative capacity of probabilistic splicing systems. Applied Math., 9: 1191-1198.

  42. Jan, N.M., W.H. Fong, N.H. Sarmin and S. Turaev, 2015. k-Watson-crick petri net controlled grammars. Int. J. Applied Math. Stat., 53: 99-106.
    Direct Link  |  

  43. Yee, S.G., W.H. Fong, N.H. Sarmin and S. Turaev, 2014. Weighted simple and semi-simple splicing systems. Malaysian J. Fundamen. Applied Sci., 10: 201-206.
    Direct Link  |  

  44. Selvarajoo, M., F.W. Heng, N.H. Sarmin and S. Turaev, 2014. Some properties of probabilistic one-sided sticker systems. Adv. Environ. Biol., 8: 717-725.

  45. Selvarajoo, M., F.W. Heng, N.H. Sarmin and S. Turaev, 2014. Probabilistic sticker systems. Malaysian J. Fundamen. Applied Sci., 9: 150-155.
    Direct Link  |  

  46. Sebry, N.M., N.Z.A. Hamzah, N.H. Sarmin, W.H. Fong and S. Turaev, 2014. Sticker systems over monoids. Malaysian J. Fundamen. Applied Sci., 8: 127-132.
    Direct Link  |  

  47. Karimi, F., S. Turaev, N.H. Sarmin and W.H. Fong, 2014. Fuzzy Splicing Systems. In: International Conference on Computational Collective Intelligence, Karimi, F., S. Turaev, N.H. Sarmin and W.H. Fong (Eds.)., Springer International Publishing, Switzerland, pp: 20-29.

  48. Jan, N.M., W.H. Fong, N.H. Sarmin and S. Turaev, 2014. Languages of watson-crick petri net. J. Teknol., 70: 97-101.
    Direct Link  |  

  49. Hamzah, N.Z.A., N.M. Sebry, W.H. Fong, N.H. Sarmin and S. Turaev, 2014. Splicing systems over permutation groups of length two. Malaysian J. Fundamen. Applied Sci., 8: 83-88.
    Direct Link  |  

  50. Gan, Y.S., W.H. Fong, N.H. Sarmin and S. Turaev, 2014. Geometrical representation of automata over some abelian groups. Malaysian J. Fundamen. Applied Sci., 8: 24-30.
    Direct Link  |  

  51. Gan, Y.S., S. Turaev, W.H. Fong and N.H. Sarmin, 2014. Computational power of weighted splicing systems. Comptes Rendus Acad. Bulgare Sci., 67: 753-762.
    Direct Link  |  

  52. Siang, G.Y., F.W. Heng, N.H. Sarmin and S. Turaev, 2013. Permutation groups in automata diagrams. Malaysian J. Fundamen. Applied Sci., 9: 35-40.
    Direct Link  |  

  53. Selvarajoo, M., W.H. Fong, N.H. Sarmin and S. Turaev, 2013. Probabilistic semi-simple splicing system and its characteristics. J. Teknol., 62: 21-26.
    Direct Link  |  

  54. Sebry, N.M., N.H. Sarmin, W.H. Fong and S. Turaev, 2013. Sticker systems over permutation groups. World Applied Sci. J., 21: 119-126.

  55. Othman, M., M.H. Selamat and S. Turaev, 2013. Concurrent Context-Free Grammars. In: Proceedings of the First International Conference on Advanced Data and Information Engineering, Herawan, T., M.M. Deris and J. Abawajy (Eds.)., Springer-Verlag, Berlin, pp: 521-528.

  56. Nguyen, N.T., B. Trawinski, R. Katarzyniak and G.S. Jo, 2013. Probabilistic Splicing Systems. In: Advanced Methods for Computational Collective Intelligence, Selvarajoo, M., M.H. Selamat, N.H. Sarmin, W.H. Fong (Eds.). Springer, Germany, pp: 259-268.

  57. Mavlankulov, G., M. Othman, M.H. Selamat and S. Turaev, 2013. Some Properties of the Concurrent Grammars. In: International Conference on Mathematical Sciences and Statistics, Kilicman, A., W.J. Leong and Z. Eshkuvatov (Eds.)., Springer, Singapore, pp: 223–231.

  58. Gan, Y.S., W.H. Fong, N.H. Sarmin and S. Turaev, 2013. Some properties and variants of weighted sticker systems. Int. J. Applied Math. Stat., 45: 367-375.
    Direct Link  |  

  59. Turaev, S., Y.S. Gan, M. Othman, N.H. Sarmin and W.H. Fong, 2012. Weighted Splicing Systems. In: Computational Intelligence and Intelligent Systems, Turaev, S., Y.S. Gan, M. Othman, N.H. Sarmin and W.H. Fong (Eds.)., Springer, Germany, pp: 416-424.

  60. Turaev, S., J. Dassow, F. Manea and M.H. Selamat, 2012. Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. Theor. Comput. Sci., 449: 134-144.
    CrossRef  |  Direct Link  |  

  61. Turaev, S., A. Krassovitskiy, M. Othman and M.H. Selamat, 2012. Parsing Algorithms for Regulated Grammars. Int. J. Math. Models Methods Appl. Sci., 6: 748-756.
    Direct Link  |  

  62. Tahghighi, M., S. Turaev, A. Jaafar, R. Mahmod and M.M. Said, 2012. On the Security of Golden Cryptosystems. Int. J. Contemp. Math. Sci., 7: 327-335.
    Direct Link  |  

  63. Turaev, S., J. Dassow and M.H. Selamat, 2011. Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. In: Descriptional Complexity of Formal Systems, Holzer, M., M. Kutrib and G. Pighizzini (Eds.)., Springer, Heidelberg, pp: 289-300.

  64. Turaev, S., J. Dassow and M. Selamat, 2011. Nonterminal complexity of tree controlled grammars. Theor. Comput. Sci., 412: 5789-5795.
    CrossRef  |  Direct Link  |  

  65. Al-Badareen, A.B., M.H. Selamat, M.A. Jabar, Jamilah Din and S. Turaev, 2011. Reusable software component life cycle. Int. J. Comput., 5: 191-199.
    Direct Link  |  

  66. Al-Badareen, A.B., M.H. Selamat, M.A. Jabar, J. Din and S. Turaev, 2011. The impact of software quality on maintenance process. Int. J. Comput., 5: 183-190.
    Direct Link  |  

  67. Al-Badareen, A.B., M.H. Selamat, M.A. Jabar, J. Din and S. Turaev, 2011. Software Quality Models: A Comparative Study. In: Software Engineering and Computer Systems. Al-Badareen, A.B., M.H. Selamat, M.A. Jabar, J. Din and S. Turaev (Eds.)., Springer, Berlin Heidelberg, pp: 46-55.

  68. Al-Badareen, A.B., M.H. Selamat, M.A. Jabar, J. Din and S. Turaev, 2011. An Evaluation Model for Software Reuse Processes. In: software engineering and computer systems. Al-Badareen, A.B., M.H. Selamat, M.A. Jabar, J. Din and S. Turaev (Eds.)., Springer, Berlin Heidelberg pp: 586-599.

  69. AL-Badareen, A.B., M.H. Selamat, J. Din, M.A. Jabar and S. Turaev, 2011. Software Quality Evaluation: User's View. Int. J. Appl. Math. Inf., 5: 200-207.
    Direct Link  |  

  70. Turaev, S. and M.H. Selamat, 2010. Grammars Controlled by Petri Nets with Inhibitor Arcs. J. Fundam. Sci., 6: 98-103.
    Direct Link  |  

  71. Dassow, J. and S. Turaev, 2010. Petri net controlled grammars with a bounded number of additional places. J. Acta Cybernetica, 19: 609-634.
    Direct Link  |  

  72. Stiebe, R. and S. Turaev, 2009. Capacity bounded grammars and Petri nets. Electron. Proc. Theor. Comput. Sci., 3: 193-203.
    CrossRef  |  

  73. Dassow, J. and S. Turaev, 2009. Petri net controlled grammars: The case of special Petri nets. J. Univ. Comput. Sci., 15: 2808-2835.
    Direct Link  |  

  74. Dassow, J. and S. Turaev, 2009. Grammars Controlled by Special Petri Nets. In: International Conference on Language and Automata Theory and Applications, Dassow, J. and S. Turaev (Eds.)., Springer, Berlin, Heidelberg, pp: 326-337.

  75. Dassow, J. and S. Turaev, 2008. k-Petri Net Controlled Grammars. In: Language and Automata Theory and Applications. Second International Conference, Martin-Vide, C., F. Otto and H. Fernau (Eds.)., Springer, Berlin, Heidelberg, pp: 209-220.

  76. Turaevc, S., 1999. The measure of asymmetry of the graph of a convex polytope. Uzbek Math. J., 4: 68-77.

  77. Turaevc, S. and A. Pulatov 1998. The measure of asymmetry of a convex 3-Polytope. Acad. Sci. Uzbekistan, 5: 5-8.