Research
My current research interest is in the areas of formal language theory, of natural/DNA computing, complex dynamic systems and FPGA design. I am particularly interested by the computational power of different models (decidability and computational completeness), as well as by the universality problem. I am also working on the implementation of parallel unconventional computing models in FPGA hardware with main applications in robotics. Other research topics are bioinformatics and systems biology.
Selected publications
Insertion/deletion systems
 M. Margenstern, G. Păun, Y. Rogozhin, S. Verlan (2005), "ContextFree InsertionDeletion Systems", Theoretical Computer Science. Vol. 330(2), pp. 339348.
Computational completeness of contextfree insertiondeletion systems of sizes (3,2) and (2,3).

S. Verlan (2007), "On Minimal ContextFree InsertionDeletion Systems", Journal of Automata, Languages and Combinatorics. Vol. 12(12), pp. 317328
Characterization of contextfree insertiondeletion systems of size (2,2).

A. Matveevici, Y. Rogozhin, S. Verlan (2007), "InsertionDeletion Systems with OneSided Contexts", In Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 1013, 2007, Proceedings. Lecture Notes in Computer Science, Volume 4664, pp. 205217. Springer
Asymmetrical systems and first incompleteness results.

I. Petre, S. Verlan (2012), "Matrix Insertion–Deletion Systems", Theoretical Computer Science. Vol. 456(0), pp. 80  88
Introduction of matrixcontrolled systems.

S. Ivanov, S. Verlan (2015), "Universality of Graphcontrolled Leftist Insertiondeletion Systems with Two States", In Machines, Computations, and Universality  7th International Conference, MCU 2015, Famagusta, North Cyprus, September 911, 2015, Proceedings. Lecture Notes in Computer Science, Volume 9288, pp. 7993. Springer.
Introduction of systems with regular contexts.
The splicing operation

M. Margenstern, Y. Rogozhin, S. Verlan (2004), "TimeVarying Distributed H Systems with Parallel Computations: the Problem is Solved", In DNA Computing: 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 13, 2003. Revised Papers. Lecture Notes in Computer Science, Volume 2943, pp. 4853. Springer.
Computational completeness of the iteration of the splicing operation.

S. Verlan, M. Margenstern (2011), "Universality of Splicing Test Tube Systems with Two Tubes", Fundam. Inform.. Vol. 110(14), pp. 329342.
Universality of the longstanding problem of 2test tube systems.

E. CsuhajVarjú, S. Verlan (2008), "On LengthSeparating Test Tube Systems", Natural Computing. Vol. 7(2), pp. 167181
A novel distributed computing model using length filtering instead of random context or target filtering.

A. Alhazov, Y. Rogozhin, S. Verlan (2012), "On Small Universal Splicing Systems", International Journal of Foundations of Computer Science. Vol. 23(07), pp. 14231438.
The smallest universal system based on the splicing operation (having only 5 splicing rules).
Membrane systems and multiset rewriting
 A. Alhazov, S. Verlan (2011), "Minimization Strategies for Maximally Parallel Multiset Rewriting Systems", Theoretical Computer Science. Vol. 412(17), pp. 1581  1591.
Universality of maximally parallel multiset rewriting (using only 23 rules).
 R. Freund, S. Ivanov, S. Verlan (2015), "P Systems with Generalized Multisets Over Totally Ordered Abelian Groups", In Membrane Computing  16th International Conference, CMC 2015, Valencia, Spain, August 1721, 2015, Revised Selected Papers. Lecture Notes in Computer Science, Volume 9504, pp. 117136. Springer.
Definition of the maximally parallel rewriting over Abelian groups.
 S. Verlan, J. Quiros (2012), "Fast Hardware Implementations of P Systems", In Membrane Computing  13th International Conference, CMC 2012, Budapest, Hungary, August 2831, 2012, Revised Selected Papers. Lecture Notes in Computer Science, Volume 7762, pp. 404423. Springer.
FPGA implementation of the maximally parallel multiset rewriting. Precomputation based on ChomskySchutzenberger theorem and formal power series. Spedup of order 10
^{5}.
 A. Spicher, S. Verlan (2011), "Generalized Communicating P Systems Working in Fair Sequential Mode", Scientific Annals of Computer Science. Vol. 21(2), pp. 227247. ``A.I. Cuza'' University Press, Iasi.
Link between fairness condition in Population protocols and Gillespie algorithm.
 R. Freund, S. Verlan (2007), "A Formal Framework for Static (Tissue) P Systems", In Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 2528, 2007 Revised Selected and Invited Papers. Lecture Notes in Computer Science, Volume 4860, pp. 271284. Springer.
A mathematical framework for the representation of membrane systems and multiset rewriting.
 S. Verlan (2013), "Using the Formal Framework for P Systems", In Membrane Computing  14th International Conference, CMC 2013, Chişinău, Republic of Moldova, August 2023, 2013, Revised Selected Papers. Lecture Notes in Computer Science, Volume 8340, pp. 5679. Springer. Invited paper.
Examples of the application of the formal framework for membrane systems.
 R. Freund, I. PérezHurtado, A. RiscosNúñez, S. Verlan (2013), "A Formalization of Membrane Systems with Dynamically Evolving Structures", International Journal of Computer Mathematics. Vol. 90(4), pp. 801815.
The extension of the formal framework to support dynamicaly evolving structures.
 F. Bernardini, M. Gheorghe, M. Margenstern, S. Verlan (2008), "How to Synchronize the Activity of All Components of a P System?", International Journal of Foundations of Computer Science. Vol. 19(5), pp. 11831198.
Firing Squad Synchronization Problem for tree structures.
 S. Verlan, F. Bernardini, M. Gheorghe, M. Margenstern (2008), "Generalized Communicating P Systems", Theoretical Computer Science. Vol. 404(12), pp. 170184.
Computational model based on signal synchronization and spatial displacement.
Unconventional computing FPGA implementations
Teaching
I am currently teaching at the Department of Computer Science, University of Paris Est Créteil. I am also responsible for the Bachelor degree in Computer Science at our university.
Here is the list of some past and present courses
 WEB Applications Security
 A course on the WEB application security based on OWASP Top10.
 WEB Programming
 PHP, Javascript, HTML and CSS.
 IoT
 A basic cours on Internet of Things.
 Formal languages
 Automata theory and contextfree grammars.
 Algorithmics and Data Structures
 Introduction to basic data structures.
 Concurrent and Network Programming
 Clientserver programming in Java.
 New Network Technologies
 NIO and serialization in Java.
 Compiler design
 Basic course on compiler design.
 Databases
 Basic course on SQL.
 Operating Systems
 Basic course on operating systems.
 Functional Programming
 Functional programming in CAML.
 Objectoriented Design
 OOP design, unit testing.