Aleksi
Saarela
Docent, Department of Mathematics and Statistics
Academy Research Fellow, Mathematics
PhD
Links
Areas of expertise
discrete mathematics
combinatorics on words
Research
My research area is discrete mathematics, or more precisely combinatorics on words. This is an area of mathematics that is closely related to theoretical computer science. Some particular topics I have been working on are word equations and k-abelian equivalence.
Publications
Degrees of infinite words, polynomials and atoms (2016)
International Conference on Developments in Language Theory
(Vertaisarvioitu artikkeli konferenssijulkaisussa (A4))
One-unknown word equations and three-unknown constant-free word equations (2016)
International Conference on Developments in Language Theory
(Vertaisarvioitu artikkeli konferenssijulkaisussa (A4))
Equivalence Relations Defined by Numbers of Occurrences of Factors (2016)
Fundamenta Informaticae
(Vertaisarvioitu alkuperäisartikkeli tai data-artikkeli tieteellisessä aikakauslehdessä (A1))
Systems of word equations, polynomials and linear algebra: A new approach (2015)
European Journal of Combinatorics
(Vertaisarvioitu alkuperäisartikkeli tai data-artikkeli tieteellisessä aikakauslehdessä (A1))
Degrees of Transducibility (2015)
Lecture Notes in Computer Science
(Vertaisarvioitu artikkeli kokoomateoksessa (A3))
On growth and fluctuation of k-abelian complexity (2015)
International Computer Science Symposium in Russia, Lecture Notes in Computer Science
(Vertaisarvioitu artikkeli konferenssijulkaisussa (A4))
5-Abelian cubes are avoidable on binary alphabets (2014)
RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(Vertaisarvioitu alkuperäisartikkeli tai data-artikkeli tieteellisessä aikakauslehdessä (A1))
Variations of the Morse-Hedlund theorem for k-abelian equivalence (2014)
International conference on developments in language theory, Lecture Notes in Computer Science
(Vertaisarvioitu artikkeli konferenssijulkaisussa (A4))
3-abelian cubes are avoidable on binary alphabets (2013)
Lecture Notes in Computer Science
(Vertaisarvioitu artikkeli konferenssijulkaisussa (A4))
On a generalization of Abelian equivalence and complexity of infinite words (2013)
Journal of Combinatorial Theory, Series A
(Vertaisarvioitu alkuperäisartikkeli tai data-artikkeli tieteellisessä aikakauslehdessä (A1))