PhD Aleksi Saarela - UTU Research Portal

Aleksi Saarela
PhD

- Academy Research Fellow,
Mathematics (Department of Mathematics and Statistics)
- Docent,
Department of Mathematics and Statistics (Faculty of Science)

amsaar@utu.fi

+358 29 450 4315

+358 50 327 7291

Vesilinnantie 5

Turku

: 393

: https://orcid.org/0000-0002-6636-2317

Personal webpage

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.

3 of 3

The Unique Decipherability in the Monoid of Regular Languages is Undecidable (2011)
- Fundamenta Informaticae
Karhumaki J, Saarela A
UNIQUE DECIPHERABILITY IN THE ADDITIVE MONOID OF SETS OF NUMBERS (2011)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
Saarela A
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms (2010)
- Discrete Mathematics and Theoretical Computer Science
Juhani Karhumäki, Aleksi Saarela
Ultimately constant abelian complexity of infinite word (2010)
- Journal of Automata, Languages and Combinatorics
Saarela Aleksi
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations (2009)
- Lecture Notes in Computer Science
Developments in Language Theory Saarela Aleksi