Institut für Informatik Fakultät für Mathematik und Informatik / Universität Leipzig


Wissenschaftliche Mitarbeiterin 
Former Research Fellow of the German Academic Exchange Service

Dr. Meenakshi Paramasivan


Room:

A 426, Augustusplatz 10

Phone:

+49-341-97/32202

Research Group:

Automaten und Sprachen

E-mail:

paramasivan at informatik.uni minus leipzig.de

Alternative E-mail:

meena_maths at yahoo.com


Address

Meenakshi Paramasivan
Universität Leipzig
Institut für Informatik
PF 100920
D-04009 Leipzig
Germany


Lehre

Sprechzeiten: Mittwoch 13:00 – 14:00 oder nach Absprache

Sommersemester 2019: Vertiefungsmodul Automatentheorie

Sommersemester 2019: Bachelor- & Masterseminar Automatentheorie



 

Publications

Conference Contributions

H. Fernau, M. Paramasivan, D. G. Thomas. Regular Grammars for Array Languages. In R. Freund, F. Mráz and D. Průša (Editors): Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA, Pages 119–134, 2017.

 

H. Fernau, M. Paramasivan, D. G. Thomas. Regular Array Grammars and Boustrophedon Finite Automata. In H. Bordihn, R. Freund, B. Nagy and Gy. Vaszil (Editors): Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA, Short Papers, Pages 55–63, 2016.

 

H. Fernau, M. Paramasivan, D. G. Thomas. Picture Scanning Automata. In R. P. Barneva, V. E. Brimkov and J. M. R. S. Tavares (Editors): International Symposium CompIMAGE'16 - Computational Modeling of Objects Presented in Images: Fundamentals, Methods, and Applications, Volume 10149 of LNCS, Pages 132-147. Springer, 2017.

 

H. Fernau, M. Paramasivan, M. L. Schmid, D. G. Thomas. Scanning Pictures The Boustrophedon Way. In R. P. Barneva, B. B. Bhattacharya and V. E. Brimkov (Editors): International Workshop on Combinatorial Image Analysis, IWCIA, Volume 9448 of LNCS, Pages 202–216. Springer, 2015.

 

H. Fernau, M. Paramasivan and M. L. Schmid. Jumping Finite Automata: Characterizations and Complexity. In F. Drewes (Editors): Implementation and Application of Automata - 20th International Conference, CIAA, Volume 9223 of LNCS, Pages 89–101. Springer, 2015.

 

H. Fernau and M. Paramasivan. Formal language questions for Eulerian trails. In T. Neary und M. Cook (Editors): Machines, Computations and Universality, MCU, Volume 128 of Electronic Proceedings in Theoretical Computer Science EPTCS, Pages 25–26. Open Publishing Association, 2013.

 

Journals

H. Fernau, M. Paramasivan und D. G. Thomas. Picture Scanning Automata and Group Actions on Pictures. Romanian Journal of Information Science and Technology, 21 (3): 238-248, 2018.

 

H. Fernau, M. Paramasivan, M. L. Schmid, D.G. Thomas. Simple Picture Processing Based on Finite Automata and Regular GrammarsJournal of Computer and System Sciences, 95: 232–258, 2018.

 

H. Fernau, M. Paramasivan, M. L. Schmid, V. Vorel. Characterization and Complexity Results on Jumping Finite AutomataTheoretical Computer Science, 679: 31–52, 2017.

 

H.Fernau and M. Paramasivan. Formal language questions for Eulerian trailsElectronic Proceedings in Theoretical Computer Science, 128: 25–26, 2013.

 

M. Paramasivan and N. G. David. Shuffle operations on Euler graphsMapana Journal of Sciences, 10(1): 63–78, 2011. (ISSN 0975-3303).