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 
4 of 6
- Variations of the Morse-Hedlund theorem for k-abelian equivalence (2014)
- Lecture Notes in Computer ScienceLecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - 3-abelian cubes are avoidable on binary alphabets (2013)
- Lecture Notes in Computer ScienceLecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Fine and Wilf's theorem for k-abelian periods (2013)
- International Journal of Foundations of Computer Science
(A1 Refereed original research article in a scientific journal) - On a generalization of Abelian equivalence and complexity of infinite words (2013)
- Journal of Combinatorial Theory, Series A
(A1 Refereed original research article in a scientific journal) - Strongly k-abelian repetitions (2013)
(A4 Refereed article in a conference publication ) - Weakly unambiguous morphisms with respect to sets of patterns with constants (2013)
(A4 Refereed article in a conference publication ) - 5-abelian cubes are avoidable on binary alphabets (2012) Robert Mercas, Aleksi Saarela
(B3 Non-refereed article in a conference publication) - Fine and Wilf's Theorem for k-Abelian Periods (2012) Proceedings of the 16th International Conference on Developments in Language Theory Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
(A4 Refereed article in a conference publication ) - Problems in between words and abelian words: k-abelian avoidability (2012)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Word Equations and Related Topics: Independence, Decidability and Characterizations (2012) Saarela A
(G5 Article dissertation )
Turun yliopiston Tutkimustietojärjestelmän portaali