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 
3 of 3
- The Unique Decipherability in the Monoid of Regular Languages is Undecidable (2011)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - UNIQUE DECIPHERABILITY IN THE ADDITIVE MONOID OF SETS OF NUMBERS (2011)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and ApplicationsJournal of Automata, Languages and Combinatorics
(A1 Refereed original research article in a scientific journal) - Noneffective Regularity of Equality Languages and Bounded Delay MorphismsOn the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations (2010)
- Discrete Mathematics and Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Ultimately constant abelian complexity of infinite word (2010)
(A1 Refereed original research article in a scientific journal) - 2009
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication )
UTU Research Portal