Aleksi Saarela
PhD
amsaar@utu.fi +358 29 450 4315 +358 50 327 7291 Vesilinnantie 5 Turku : 393 |
discrete mathematics; combinatorics on words
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.
1 of 6
- A Connection Between Unbordered Partial Words and Sparse RulersMapped Exponent and Asymptotic Critical Exponent of Words (2026)
- The Electronic Journal of CombinatoricsTheory of Computing Systems
- An Improved Version of Hmelevskii's Theorem on Three-Variable Word EquationsOn the Solution Sets of Three-Variable Word Equations (2026)
- LIPICS – Leibniz International Proceedings in Informatics
- (2025)
- Lecture Notes in Computer Science
- (2024)
- (2023)
- Lecture Notes in Computer Science
- (2022)
- SIAM Journal on ComputingJournal of Combinatorial Theory, Series A
- Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics (2021) Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics Hakanen Anni, Halava Vesa, Herva Pyry, Kari Jarkko, Laihonen Tero, Petre Ion, Saarela Aleksi
- Separating the Words of a Language by Counting Factors (2021)
- Fundamenta Informaticae
- Standard words and solutions of the word equation X_1^2 ··· X_n^2 = (X_1 ··· X_n)^2 (2021)
- Hardness results for constant-free pattern languages and word equations (2020)
- LIPICS – Leibniz International Proceedings in Informatics
UTU Research Portal