Reports :

Course

Ongoing

Completed

M.Sc.

0

21

B.Tech. (Minor Stream)

0

2

M.Tech.

0

6

Ph.d.

0

10

Ph.D. Guided:

  1. S.N. Krishna, Languages of P Systems: Computatbility and Complexity, 2001. (Prof. IITB)
  2. K. Lakshmanan, On the Crossroads of P Systems and Contextual Grammars, Variants, Computability, Complexity and Efficiency, 2004. (Prof. VIT Vellore)
  3. S. Vijayakumar, Sorting with Transpositions, 2004. (Asst. Prof. IIIT D&M)
  4. H.Ramesh, Some Variants of Computationally Complete P Systems, 2008. (Asst. Prof. IITG)
  5. L.Jeganathan, Abstraction of splicing, Self-Assembly and crossover : Languages to Axiom Approach, 2009. (Prof. VIT Chennai)
  6. WI Suresh Kumar, July 2016, Two Dimensional P Systems: Arrays, Graphs and Applications (Asso. Prof. VIT Chennai)
  7. Bala Suyambu, Jan 2017, Development of New Image Security Schemes Using Cellular Automata for Improved Performance. (Cyber Security Senior Specialist, SAP, Bengaluru)
  8. Ujjwal Kumar Mishra (Co-Guide), March 2022, Watson-Crick Jumping Finite Automata: Variants, Comparision, & Closure. (Asst. Prof. VIT Bhopal)
  9. Sivasankar M, Dec 2023, Two-dimensional Fibonacci words and Fibonaccilike words: Patterns and properties (Asst. Prof., PES University, Bengaluru)
  10. Rajavel Praveen M, May 2024, Rauzy Graphs: Variants and Properties (T.I.M.E. Private limited, Chennai)

M.Tech Guided:

·    Jagadeswar Marrapu, Matrix Splicing Systems, 2005.

·    Surendra Kumar Y, Tool for P System Computation, 2007.

·    Dharmendra Verma, Genetic algorithm for repeated Hawk-Dove game using finite automata, 2011.

·    Suresh Badarla, On k-trees, k-connectedness and clique decomposition of graphs, 2011.

·    Rama Naidu, Generation of Spanning tress using Prufer like sequence, 2012 .

·    Suresh Kumar Yadav, Self assembly of graphs on edges, 2012 .

M.Sc. Project- Completed:

·    L.A.Anbarasu, Some Properties of Node Rewriting Graph Grammars,1993.

·    P.Muthu, Some Results on Graceful Graphs 1994.

·    Srigiri Sri Lakshmi, Some Properties of L-Array Models, 1995.

·         V Sumitha, Splicing on Arrays, 1997.

·    M.Thilagam, Some Results on Isotonic Array Grammars,1998.

·    Smitha T A ,Some Results on Contextual Grammars, 1998.

·    Uma Raghavan, Some properties of Splice Array Systems,1998.

·    K.Jayasree, Circular Arrays and Splicing Systems, 1999.

·    I.Mohammed Rizwan Sadiq, Circuitry Implementation of a Distributed Finite Automata, 2000.

·    Kalpana M , Parametrized Communicating L-Systems,2000.

·    Phoebe Vanmathy Julius, Distributed Generalised Sequential Machines,2001.

·    Shameen M.K., Stochastic Grammar and Stochastic Finite State Automata, 2003.

·         V.Baskar, L Systems and Space Filling Curves, 2004.

·    B.Kumar, Fractional Derivatives and Fractional Integrals , 2005.

·    Harish B , Arithmetic and Logic Operations with DNA, 2005.

·    Kashyap R, Theoretical Model for Solving "Partition of Graphs into Triangles" using DNA strands, 2005.

·    Suchitra Ganguly, Tree Representation of Grammars, 2007.

·    B.Karikol Raj, Sequential Insertion and Differential Semi-rings, 2007.       

·         Batcha Srisailam, Modular Arithmetic and its applications, 2009.

·         Ravi-E, Graceful Labelling of a graph, 2011.

·         Kiran Kumar T, The Spectrum of a graph, 2011.

B.Tech Guided:

·    Vijay H Madhusudan, Quantum grammars, 2001.

·         Annop Geoge Varghese, A review of Longest Common Subsequence Problem, 2001.