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
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (2017)
- Acta Cybernetica
(A1 Refereed original research article in a scientific journal) - Word equations where a power equals a product of powers (2017)
- LIPICS – Leibniz international proceedings in informaticsLecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Degrees of infinite words, polynomials and atoms (2016) Developments in Language Theory: 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
(A4 Refereed article in a conference publication ) - Equivalence Relations Defined by Numbers of Occurrences of Factors (2016)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - One-unknown word equations and three-unknown constant-free word equations (2016) Developments in Language Theory: 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings Dirk Nowotka, Aleksi Saarela
(A4 Refereed article in a conference publication ) - (2015)
- Lecture Notes in Computer ScienceJournal of Combinatorial Theory, Series A
(A3 Refereed book chapter or chapter in a compilation book) - (2015)
- Lecture Notes in Computer ScienceLecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - (2015)
- European Journal of CombinatoricsLecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - 5-Abelian cubes are avoidable on binary alphabets5-abelian cubes are avoidable on binary alphabets (2014)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - Variations of the Morse-Hedlund theorem for k-abelian equivalence (2014)
(A4 Refereed article in a conference publication ) - 3-abelian cubes are avoidable on binary alphabets (2013)
- Lecture 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)
(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 ) - (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 ) - Local squares, periodicity and finite automata (2011)
- Lecture Notes in Computer Science
(A3 Refereed book chapter or chapter in a compilation book)
UTU Research Portal