Aleksi Saarela
PhD
amsaar@utu.fi +358 29 450 4315 +358 50 327 7291 Vesilinnantie 5 Turku Office: 393 ORCID identifier: https://orcid.org/0000-0002-6636-2317 |
Areas of expertise
discrete mathematics; combinatorics on words
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.
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 
2 of 6
- Independent Systems of Word Equations: From Ehrenfeucht to Eighteen (2019)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - On abelian saturated infinite words (2019)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Separating many words by counting occurrences of factors (2019)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Word equations with kth powers of variables (2019)
- Journal of Combinatorial Theory, Series A
(A1 Refereed original research article in a scientific journal) - An optimal bound on the solution sets of one-variable word equations and its consequences (2018)
- LIPICS – Leibniz International Proceedings in Informatics
(A4 Refereed article in a conference publication ) - Degrees of Infinite Words, Polynomials and Atoms (2018)
- International Journal of Foundations of Computer Science
(A1 Refereed original research article in a scientific journal) - One-Variable Word Equations and Three-Variable Constant-Free Word Equations (2018)
- International Journal of Foundations of Computer Science
(A1 Refereed original research article in a scientific journal) - Studying Word Equations by a Method of Weighted Frequencies (2018)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - On growth and fluctuation of k-abelian complexity (2017)
- European Journal of Combinatorics
(A1 Refereed original research article in a scientific journal) - Palindromic length in free monoids and free groups (2017)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication )
UTU Research Portal