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 
2 of 3
- Degrees of Transducibility (2015)
- Lecture Notes in Computer Science
(A3 Book chapter) - On growth and fluctuation of k-abelian complexity (2015)
- Lecture Notes in Computer Science
(A4 Article in conference proceedings) - Systems of word equations, polynomials and linear algebra: A new approach (2015)
- European Journal of Combinatorics
(A1 Journal article – refereed) - 5-Abelian cubes are avoidable on binary alphabets (2014)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Journal article – refereed) - Variations of the Morse-Hedlund theorem for k-abelian equivalence (2014)
- Lecture Notes in Computer Science
(A4 Article in conference proceedings) - 3-abelian cubes are avoidable on binary alphabets (2013)
- Lecture Notes in Computer Science
(A4 Article in conference proceedings) - Fine and Wilf's theorem for k-abelian periods (2013)
- International Journal of Foundations of Computer Science
(A1 Journal article – refereed) - On a generalization of Abelian equivalence and complexity of infinite words (2013)
- Journal of Combinatorial Theory, Series A
(A1 Journal article – refereed) - Strongly k-abelian repetitions (2013)
- Lecture Notes in Computer Science
(A4 Article in conference proceedings) - Weakly unambiguous morphisms with respect to sets of patterns with constants (2013)
- Lecture Notes in Computer Science
(A4 Article in conference proceedings) - 5-abelian cubes are avoidable on binary alphabets (2012) Robert Mercas, Aleksi Saarela
(B3 Article in conference proceedings) - 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 Article in conference proceedings) - Problems in between words and abelian words: k-abelian avoidability (2012)
- Theoretical Computer Science
(A1 Journal article – refereed) - Word Equations and Related Topics: Independence, Decidability and Characterizations (2012) Saarela A
(G5 Doctoral dissertation (article)) - Local squares, periodicity and finite automata (2011)
- Lecture Notes in Computer Science
(A3 Book chapter) - On maximal chains of systems of word equations (2011)
- Proceedings of the Steklov Institute of Mathematics
(A1 Journal article – refereed) - Systems of word equations and polynomials: a new approach (2011) Proceedings of the 8th International Conference WORDS Saarela A
(A4 Article in conference proceedings) - The Unique Decipherability in the Monoid of Regular Languages is Undecidable (2011)
- Fundamenta Informaticae
(A1 Journal article – refereed) - UNIQUE DECIPHERABILITY IN THE ADDITIVE MONOID OF SETS OF NUMBERS (2011)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Journal article – refereed) - Noneffective Regularity of Equality Languages and Bounded Delay Morphisms (2010)
- Discrete Mathematics and Theoretical Computer Science
(A1 Journal article – refereed)
UTU Research Portal