Aleksi
Saarela
Docent, Department of Mathematics and Statistics
Academy Research Fellow, Mathematics
PhD
Links
Areas of expertise
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.
Publications
Local squares, periodicity and finite automata (2011)
Lecture Notes in Computer Science
(Vertaisarvioitu artikkeli kokoomateoksessa (A3))
The Unique Decipherability in the Monoid of Regular Languages is Undecidable (2011)
Fundamenta Informaticae
(Vertaisarvioitu alkuperäisartikkeli tai data-artikkeli tieteellisessä aikakauslehdessä (A1))
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms (2010)
Discrete Mathematics and Theoretical Computer Science
(Vertaisarvioitu alkuperäisartikkeli tai data-artikkeli tieteellisessä aikakauslehdessä (A1))
Ultimately constant abelian complexity of infinite word (2010)
Journal of Automata, Languages and Combinatorics
(Vertaisarvioitu alkuperäisartikkeli tai data-artikkeli tieteellisessä aikakauslehdessä (A1))
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations (2009)
International Conference on Developments in Language Theory, Lecture Notes in Computer Science
(Vertaisarvioitu artikkeli konferenssijulkaisussa (A4))