Robert's research

Your web browser must have JavaScript enabled in order for this application to display correctly.

Reducing The Ambiguity Of Parikh Matrices: Language and Automata Theory and Applications (LATA 2020 & 2021), Milan, Italy .
On the number of factors with maximal-exponent in words: Developments in Language Theory (DLT 2017), Liège, Belgium .
Counting maximal-exponent factors in words: Days of Computer Science (DACS 2016), Bucharest, Romania .
Algorithms on sequences: Invited Lecture at Goldsmiths, University of London, UK .
On the k-abelian equivalence: Days of Computer Science (DACS 2014), Bucharest, Romania .
k-Abelian Pattern Matching: Combinatorics and Algorithmics of Strings, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany .
Repetitions in Partial Words: Anniversary Conference, Faculty of Sciences - 150 years, University of Bucharest, Romania .

Counting distinct squares: give a bound on the maximum number of distinct squares that a word can have as factors
Number of Lyndon roots in a factor: give a bound on the maximum number of Lyndon roots that a factor of a word can have