I did work in TCS group led by Prof. Dr. Henning Fernau at the University of Trier.
My research interests are graph theory, automata theory, formal language theory, pattern recognition in image analysis, membrane computing (P system) and logic.
For contact details, look at the bottom of this page.
Short CV
Oct 2019 - Mar 2022: Postdoctoral Research Associate (Wissenschaftliche Mitarbeiterin), University of Trier, Germany.
Apr 2019 - Sept 2019: Postdoctoral Research Associate (Wissenschaftliche Mitarbeiterin), University of Leipzig, Germany.
Oct 2017 - Mar 2018: Research Assistant (Wiss. Hilfskraft), University of Trier, Germany (supported by Prof. Dr.-Ing. Ingo. J. Timm (CIRT) for Celtic Studies with Prof. Dr. -Phil. Jürgen Zeidler).
2013 - 2017: Doctor of Natural Sciences in Theoretical Computer Science, University of Trier, Germany (supported by DAAD PhD Funding Programme – Research Grants for Doctoral Candidates and Young Academics and Scientists – Programme ID: 57076385).
2009 - 2010: Master of Philosophy in Mathematics, Madras Christian College (Autonomous), affiliated to the University of Madras, India.
2007 - 2009: Master of Science in Mathematics, Madras Christian College (Autonomous), affiliated to the University of Madras, India.
2004 - 2007: Bachelor of Science in Mathematics, Madras Christian College (Autonomous), affiliated to the University of Madras, India.
Projects
DAAD project 57596471, "Postdoctoral Researchers International Mobility Experience" (PRIME), 2021/22 (Rejected).
DAAD project 57554177, "Exchange of experiences in Research and Teaching between Chennai and Trier" (Erfahrungsaustausch in Forschung und Lehre zwischen Chennai und Trier) in the funding program "Indo-German Partnerships (DIP) 2020-2024" (Not Successful). Coordinated for the Letter of Intent between the Madras Christian College (Autonomous), affiliated to the University of Madras, India and the University of Trier, Germany.
Invited Talks
05 July 2022
Fachrichtung Mathematik Universität des Saarlandes
This talk aims to introduce a few types of automata and grammar models and gives an overview on the class of languages recognized by them in the two-dimensional world. A two-dimensional string (or a picture) is a two-dimensional rectangular array of symbols taken from a finite alphabet. A two-dimensional language (or picture language) is a set of pictures.
Title: Picture Processing Models: 2D Automata and Grammars
Date: Tuesday, July 05, 2022
Time: 14:00 - 15:00
Place: Department of Computer Science, Saarland Informatics Campus E24, R. 425.
24 March 2022
Tranquebar Bishop Manikam Lutheran College (TELC) Porayur – 609307, Mayiladuthurai District, Tamilnadu, India (Affiliated to Annamalai University, Chidambaram)
International Conference on Pure and Applied Mathematics (ICOPAM 2022) on 24th and 25th March 2022 (Virtual)
Google Meet: jyo-mnex-pox
Title: Operations on Arrays and Two-Dimensional Picture Languages
Time: 2.00 PM to 4.00 PM (DIGITAL)
27 Mar 2021
SSN College of Engineering, Old Mahabalipuram Road, SSN Nagar - 603 110, Tamil Nadu, India.
A two-day national workshop on “An insight into Mathematical Modelling in Information and Communication Engineering (MMICE)”
Title: Operations on Arrays
Time: 1.30 PM to 3.00 PM (DIGITAL)
8 Jan 2020 – 10 Jan 2020
Madras Christian College, Chennai, India
A three-day lecture series on “Applications of formal languages and automata theory” This lecture series was on six topics: Weighted Finite Automata, Automata in Image Processing, Natural Language Processing, Pattern Matching, Compiler Construction, Automata in Machines and Games to motivate undergraduate, postgraduate and staff members of Department of Mathematics to applications of formal languages and automata theory.
Day 1: Weighted Finite Automata
Day 1: Image Processing
Date: Wednesday, January 8, 2020
Day 2: Natural Language Processing
Day 2: Text Processing and Pattern Matching
Date: Thursday, January 9, 2020
Day 3: Compiler Construction
Day 3: Automata in Machines and Games
Date: Friday, January 10, 2020
Time: 14:00 - 17:00
Place: Department of Mathematics, Madras Christian College, East Tambaram, Chennai – 600059
24 Jan 2019
Institute of Computer Science of the University of Leipzig
This talk aims to introduce a few types of automata and grammar models and gives an overview on the class of languages recognized by them in the two-dimensional world. A two-dimensional string (or a picture) is a two-dimensional rectangular array of symbols taken from a finite alphabet. A two-dimensional language (or picture language) is a set of pictures.
Title: Operations on Arrays
Date: Thursday, January 24, 2019
Time: 13:30 - 15:00
Place: P801, Institute of Computer Science of the University of Leipzig, Augustusplatz 10, Leipzig
20 Dec 2018
Charles University in Prague
Abstract: A lecture on new types of 2D-automata and grammars. Automata theory studies abstract machines and analyses their properties. It is closely related to formal language theory and belongs to fundamentals of theoretical computer science.
Title: Operations on Arrays
Date: Thursday, December 20, 2018
Time: 12:30 - 13:30
Place: Lecture hall S1, Faculty of Mathematics and Physics, Charles University in Prague, Malostranské náměstí 25, Praha 1
19 Mar 2015
Ada-Lovelace-Project, Trier & Agentur für Arbeit Trier
Abstract: A basic lecture on graphs, graph problems, uses of graphs and some applications. This basic lecture aimed to attract female school students as part of m³ = Mädchen Machen MINT.
Title: Graph Theory and its Applications
Date: Thursday, March 19, 2015
Place: Trier, Germany
Talks
“Weighted Three Directions OTA and Weighted Hexapolic Picture Automata”, IWCIA 2022, the 21st International Workshop on Combinatorial Image Analysis, July 13–15, 2022, at Messina (Italy). (DIGITAL). [slides] [photos] [recordings]
“Weighted Hexagonal Picture Automata”, the 31st meeting for the specialized group ‘Automata and Formal Languages’ of the society for computer science, September 20-21, 2021, at Leipzig, Germany. (DIGITAL). [slides] [photos] [recordings]
“Complexity Results on BFA”, Dagstuhl Seminar 20483 'Modern Aspects of Complexity Theory in Automata Theory', November 22 - 27, 2020 (DIGITAL). [slides] [photos] [recordings]
“How are Eulerian trails connected to formal languages?”, the 29th meeting for the specialized group ‘Automata and Formal Languages’ of the society for computer science, September 25-27, 2019, at Bremen, Germany. [slides] [photos] [recordings]
“Regular Grammars for Array Languages”, the 27th meeting for the specialized group ‘Automata and Formal Languages’ of the society for computer science, September 18-22, 2017, at Bonn, Germany. [slides] [photos] [recordings]
“Regular Grammars for Array Languages”, NCMA 2017, the 9th Workshop on Non-Classical Models of Automata and Applications, August 17-18, 2017, at Prague, Czech Republic. [slides] [photos] [recordings]
“Picture Scanning Automata”, the 26th meeting for the specialized group ‘Automata and Formal Languages’ of the society for computer science, October 04-07, 2016, at Neumünster, Germany. [slides] [photos] [recordings]
“Picture Scanning Automata”, the International Symposium CompIMAGE'16 - Computational Modeling of Objects Presented in Images: Fundamentals, Methods, and Applications, September 21 - 23, 2016 at Niagara Falls, USA. [slides] [photos] [recordings]
“Regular Array Grammars and Boustrophedon Finite Automata”, NCMA 2016, the 8th Workshop on Non-Classical Models of Automata and Applications, August 29-30, 2016 at Debrecen, Hungary. [slides] [photos] [recordings]
“Scanning Pictures the Boustrophedon Way”, Theorietag 2015, the 25th meeting for the specialized group ‘Automata and Formal Languages’ of the society for computer science, September 28 - October 02, 2015, at Speyer, Germany. [slides] [photos] [recordings]
“Jumping Finite Automata: Characterizations and Complexity”, CIAA 2015, the 20th International Conference on Implementation and Application of Automata, August 18-21, 2015, at Umeå, Sweden. [slides] [photos] [recordings]
“Remarks on Jumping Finite Automata”, Theorietag 2014, the 24th meeting for the specialized group ‘Automata and Formal Languages’ of the society for computer science, September 23-25, 2014, at Caputh, Germany. [slides] [photos] [recordings]
“Formal Language Questions for Eulerian Trails”, Machines, Computations and Universality (MCU) 2013, the 6th conference in the MCU series, September 9-11, 2013, at University of Zürich, Switzerland. [slides] [photos] [recordings]
“Saving on Phases: Parameterized Approximation for Total Vertex Cover”, 23rd International Workshop on Combinatorial Algorithms (IWOCA) 2012, July 19-21, 2012 at Kalasalingam University, Tamil Nadu, India. (On behalf of Prof. Dr. Henning Fernau). [slides] [some photos] [recordings]
“Shuffle Operations on Euler Graphs”, II National Conference on Emerging Trends in Fluid Mechanics and Graph Theory, February 11-12, 2011, at Christ University, Bangalore, India. [slides] [some photos] [recordings]
“A Study on Shuffle Operations”, M. Phil. Viva Voce October 18, 2010, at Madras Christian College, Chennai, India. [slides] [photos]
Publications
Meenakshi Paramasivan, R. Krishna Kumari, R. Arulprakasam and V. Rajkumar Dare. Lyndon Partial Words and Arrays with Applications. In Reneta P. Barneva, Valentin E. Brimkov, Giorgio Nordo (Editors): 21st International Workshop on Combinatorial Image Analysis, IWCIA, Volume 13348 of LNCS, Pages 226-244, Springer 2022.
Helen Vijitha Ponraj, Robinson Thamburaj and Meenakshi Paramasivan. 2D Oxide Picture Languages and Their Properties. In Reneta P. Barneva, Valentin E. Brimkov, Giorgio Nordo (Editors): 21st International Workshop on Combinatorial Image Analysis, IWCIA, Volume 13348 of LNCS, Pages 204-225, Springer 2022.
K. Janaki, R. Arulprakasam, Meenakshi Paramasivan and V. Rajkumar Dare. Algebraic Properties of Parikh q-matrices of Two-Dimensional Words. In Reneta P. Barneva, Valentin E. Brimkov, Giorgio Nordo (Editors): 21st International Workshop on Combinatorial Image Analysis, IWCIA, Volume 13348 of LNCS, Pages 171-188, Springer 2022.
Meenakshi Paramasivan and D. Gnanaraj Thomas. Weighted Three Directions OTA and Weighted Hexapolic Picture Automata. In Reneta P. Barneva, Valentin E. Brimkov, Giorgio Nordo (Editors): 21st International Workshop on Combinatorial Image Analysis, IWCIA, Volume 13348 of LNCS, Pages 139-153, Springer 2022.
R. Krishna Kumari, R. Arulprakasam, Meenakshi Paramasivan and V. Rajkumar Dare. Cyclic Partial Words and Arrays. 17th International Symposium on Artificial Intelligence and Mathematics, ISAIM, Electronic Proceedings, 2022.
P. Helen Vijitha, T. Robinson and Meenakshi Paramasivan. Two-dimensional Oxide Picture Languages. 17th International Symposium on Artificial Intelligence and Mathematics, ISAIM, Electronic Proceedings, 2022.
S. James Immanuel, S. Jayasankar, D. Gnanaraj Thomas, M. Gayathri Lakshmi and Meenakshi Paramasivan. Some Results on Parallel Contextual Hexagonal Array Insertion Deletion P System. In György Vaszil, Claudio Zandron, and Gexiang Zhang (Editors): 22nd International Conference on Membrane Computing, ICMC, (Short Papers) Pages 573 – 581, 2021.
S. James Immanuel, S. Jayasankar, D. Gnanaraj Thomas and Meenakshi Paramasivan. Parallel Contextual Array Insertion Deletion P Systems and Tabled Matrix Grammars. In Rudolf Freund, Tseren-Onolt Ishdorj, Grzegorz Rozenberg, Arto Salomaa, Claudio Zandron (Editors): 21st International Conference on Membrane Computing, CMC, Volume 12687 of LNCS, Pages 46 – 77, Springer 2021.
S. Jayasankar, D. G. Thomas, S. J. Immanuel, Meenakshi Paramasivan, T. Robinson and A. K. Nagar. Parallel Contextual Array Insertion Deletion P Systems and Siromoney Matrix Grammars. International Journal of Parallel, Emergent and Distributed Systems (IJPEDS) 1-24, 2021.
T. Kalyani, K. Sasikala, D. Gnanaraj Thomas, T. Robinson, Atulya K. Nagar and Meenakshi Paramasivan. 3D-Array Token Petri Nets Generating Tetrahedral Picture Languages. In Tibor Lukic, Reneta P. Barneva, Valentin E. Brimkov, Lidija Comic, Natasa Sladoje (Editors): 20th International Workshop on Combinatorial Image Analysis, IWCIA, Volume 12148 of LNCS, Pages 88-105, Springer 2020.
S. Jayasankar, D. Gnanaraj Thomas, S. James Immanuel, Meenakshi Paramasivan, T. Robinson and Atulya K. Nagar. Parallel Contextual Array Insertion Deletion Grammar and (Context-Free: Context-Free) Matrix Grammar. In Tibor Lukic, Reneta P. Barneva, Valentin E. Brimkov, Lidija Comic, Natasa Sladoje (Editors): 20th International Workshop on Combinatorial Image Analysis, IWCIA, Volume 12148 of LNCS, Pages 147-163, Springer 2020.
Ph.D. Thesis ‘Operations on Graphs, Arrays and Automata’ with magna cum laude, 2017.
Henning Fernau, Meenakshi Paramasivan and D. Gnanaraj Thomas. Regular Grammars for Array Languages. In Rudolf Freund, Frantisek Mráz and Daniel Průša (Editors): Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA, Volume 329 of ACS, Pages 119–134, Austrian Computer Society, 2017.
Henning Fernau, Meenakshi Paramasivan and D. Gnanaraj Thomas. Regular Array Grammars and Boustrophedon Finite Automata. In Henning Bordihn, Rudolf Freund, Benedek Nagy and György Vaszil (Editors): Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA, Volume 321 (Short Papers) of ACS, Pages 55–63, Austrian Computer Society, 2016.
Henning Fernau, Meenakshi Paramasivan, D. Gnanaraj Thomas. Picture Scanning Automata and Group Actions on Pictures. Romanian Journal of Information Science and Technology, 21 (3): 238-248, 2018.
Henning Fernau, Meenakshi Paramasivan and D. Gnanaraj Thomas. Picture Scanning Automata. In Reneta P. Barneva, Valentin E. Brimkov and João Manuel R. S. Tavares (Editors): 5th International Symposium on Computational Modeling of Objects Presented in Images: Fundamentals, Methods, and Applications, CompIMAGE’16, Volume 10149 of LNCS, Pages 132-147. Springer, 2017.
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas. Simple Picture Processing Based on Finite Automata and Regular Grammars. Journal of Computer and System Sciences, 95: 232–258, 2018.
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid and D. Gnanaraj Thomas. Scanning Pictures the Boustrophedon Way. In Reneta P. Barneva, Bhargab B. Bhattacharya and Valentin E. Brimkov (Editors): 17th International Workshop on Combinatorial Image Analysis, IWCIA, Volume 9448 of LNCS, Pages 202–216. Springer, 2015.
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid and Vojtěch Vorel. Characterization and Complexity Results on Jumping Finite Automata. Theoretical Computer Science, 679: 31-52, 2017.
Henning Fernau, Meenakshi Paramasivan and Markus L. Schmid. Jumping Finite Automata: Characterizations and Complexity. In Frank Drewes (Editor): 20th International Conference on Implementation and Application of Automata, CIAA, Volume 9223 of LNCS, Pages 89–101. Springer, 2015.
Henning Fernau and Meenakshi Paramasivan. Formal language questions for Eulerian trails. Electronic Proceedings in Theoretical Computer Science, 128: 25–26, 2013. (ISSN: 2075-2180) [DOI: https://doi.org/10.4204/EPTCS.128]
Henning Fernau and Meenakshi Paramasivan. Formal language questions for Eulerian trails. In Turlough Neary and Matthew Cook (Editors): Machines, Computations and Universality, MCU, Volume 128 of Electronic Proceedings in Theoretical Computer Science EPTCS, Pages 25–26, Open Publishing Association, 2013.
Meenakshi Paramasivan and N. Gnanamalar David. Shuffle operations on Euler graphs. Mapana Journal of Sciences, 10(1): 63–78, 2011. (ISSN: 0975-3303) [DOI: https://doi.org/10.12723/mjs.18.6].
M. Phil. Dissertation ‘A Study on Shuffle Operations’ with GPA 5.84 for 6.00, 2010. (Supervisor: Prof. Dr. V. Rajkumar Dare (his picture in July 1987))
Basic research on one of the oldest clans:
கேலரன் கிளை (கேள் அரன் கிளை) (KA)
தென்னங்கிளை (தென்னவன் கிளை) (TN)
திருகூம்பு கிளை (திரு அம்பலவன் கிளை) (TK)
திருமாங்கிளை (திருமால் கிளை) (TM)
நரையங்கிளை (நரசிம்மன் கிளை) (NS)
காங்கேயன் கிளை (காங்கேயன் கிளை) (KK)
காலியாகிளை (காளியார் கிளை) (KY)
Boys Girls
0. B0. ---- G0. ----
B1. KA G1. KA
B2. TN G2. TN
B3. TK G3. TK
B4. TM G4. TM
B5. NS G5. NS
B6. KK G6. KK
B7. KY G7. KY
(B0,G0) (B0,G1) (B0,G2) (B0,G3) (B0,G4) (B0,G5) (B0,G6) (B0,G7)
(B1,G0) (B1,G1) (B1,G2) (B1,G3) (B1,G4) (B1,G5) (B1,G6) (B1,G7)
(B2,G0) (B2,G1) (B2,G2) (B2,G3) (B2,G4) (B2,G5) (B2,G6) (B2,G7)
(B3,G0) (B3,G1) (B3,G2) (B3,G3) (B3,G4) (B3,G5) (B3,G6) (B3,G7)
(B4,G0) (B4,G1) (B4,G2) (B4,G3) (B4,G4) (B4,G5) (B4,G6) (B4,G7)
(B5,G0) (B5,G1) (B5,G2) (B5,G3) (B5,G4) (B5,G5) (B5,G6) (B5,G7)
(B6,G0) (B6,G1) (B6,G2) (B6,G3) (B6,G4) (B6,G5) (B6,G6) (B6,G7)
(B7,G0) (B7,G1) (B7,G2) (B7,G3) (B7,G4) (B7,G5) (B7,G6) (B7,G7)
64 types of pairs may exist but the following types are NOT allowed formally.
(B0,G0) is not included in the community as the pair does not belong to none of the 7 Categories.
(B,G)s of same types are not allowed, that is, pairs with same type of B vs G as the Boy and Girl are considered as brothers and sisters, as both belong to one of the 7 Categories.
(B0,G)s are not allowed, that is, pairs with B0 as the Boy does not belong to none of the 7 Categories.
(B,G0)s are not allowed, that is, pairs with G0 as the Girl does not belong to none of the 7 Categories.
After all the above four restrictions only 42 types of pairs can exist strictly within the community.
References:
நன்குடி வேளாளர் - தமிழ் விக்கிப்பீடியா