Mathematics
- 21st International Workshop on Cellular Automata and Discrete Complex Systems – Exploratory Papers of AUTOMATA 2015 (2015)
 - 3-abelian cubes are avoidable on binary alphabets (2013)
 - 5-Abelian cubes are avoidable on binary alphabets (2014)
 - 5-abelian cubes are avoidable on binary alphabets (2012)
 - Abelian bordered factors and periodicity (2016)
 - Abelian complexity of minimal subshifts (2011)
 - Abelian maximal pattern complexity of words (2015)
 - Abelian periods of factors of Sturmian words (2020)
 - Abelian powers and repetitions in Sturmian words (2016)
 - Abelian returns in Sturmian words. (2011)
 





