My research interest spans over the areas of Algorithms on sequences, Combinatorics on Words, and Formal Languages.
I am also interested in Trace Monoids and Bioinformatics (algorithms).
Sometime ago I have published some work related to the formalism of networks of processors, and that of natural language processing.
The pseudopalindromic completion of regular languages. I&C (with S.Z. Fazekas, F. Manea, K. Shikishima-Tsuji)
Inner palindromic closure. IJFCS (with J. Dassow, F. Manea, M. Müller)
An Algorithmic Toolbox for Periodic Partial Words. DAM (with F. Manea, C. Tiseanu)
k-Abelian Pattern Matching. DLT 2014 (with T. Ehlers, F. Manea, D. Nowotka)
5-Abelian Cubes Are Avoidable on Binary Alphabets. RAIRO - ITA (with A. Saarela)
Binary patterns in binary cube-free words: avoidability and growth. RAIRO - ITA (with P. Ochem, A. Samsonov, A. Shur)
Regular Languages of Partial Words. Inf. Sci. (with J. Dassow, F. Manea)