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 
1 of 3
- On the Solution Sets of Three-Variable Word Equations (2024)
- Theory of Computing Systems
(A1 Refereed original research article in a scientific journal) - On the Solution Sets of Entire Systems of Word Equations (2023)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (2022)
- SIAM Journal on Computing
(A1 Refereed original research article in a scientific journal) - 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
(Other publication) - Separating the Words of a Language by Counting Factors (2021)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - (2021)
- Journal of Combinatorial Theory, Series A
(A1 Refereed original research article in a scientific journal) - (2020)
- LIPICS – Leibniz international proceedings in informaticsInternational Journal of Foundations of Computer Science
(A4 Refereed article in a conference publication ) - Independent Systems of Word Equations: From Ehrenfeucht to Eighteen2019
- Lecture Notes in Computer ScienceInternational Journal of Foundations of Computer Science
(A4 Refereed article in a conference publication ) - On abelian saturated infinite wordsStudying Word Equations by a Method of Weighted Frequencies (2019)
- Theoretical Computer ScienceFundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - 2019
- Lecture Notes in Computer ScienceEuropean Journal of Combinatorics
- Word equations with kth powers of variablesPalindromic length in free monoids and free groups2019
- Journal of Combinatorial Theory, Series ALecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - 2018
- LIPICS – Leibniz international proceedings in informatics
(A4 Refereed article in a conference publication ) - Degrees of Infinite Words, Polynomials and Atoms (2018)
(A1 Refereed original research article in a scientific journal) - One-Variable Word Equations and Three-Variable Constant-Free Word Equations (2018)
(A1 Refereed original research article in a scientific journal) - (2018)
(A1 Refereed original research article in a scientific journal) - On growth and fluctuation of k-abelian complexity (2017)
(A1 Refereed original research article in a scientific journal) - (2017)
(A4 Refereed article in a conference publication ) - Proceedings of the Fourth Russian Finnish Symposium on Discrete Mathematics (2017) Juhani Karhumäki, Yuri Matiyasevich, Aleksi Saarela
(C2 Editorial work for a scientific compilation book) - Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (2017)
- Acta Cybernetica
(A1 Refereed original research article in a scientific journal) - Word equations where a power equals a product of powers (2017)
- LIPICS – Leibniz international proceedings in informatics
(A4 Refereed article in a conference publication )
UTU Research Portal