Aleksi Saarela
PhD
amsaar@utu.fi +358 29 450 4315 +358 50 327 7291 Vesilinnantie 5 Turku : 393 |
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 6
- Proceedings of the Fourth Russian Finnish Symposium on Discrete Mathematics (2017) Juhani Karhumäki, Yuri Matiyasevich, Aleksi Saarela
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (2017)
- Acta Cybernetica
- Word equations where a power equals a product of powers (2017)
- LIPICS – Leibniz International Proceedings in Informatics
- 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
- Equivalence Relations Defined by Numbers of Occurrences of Factors (2016)
- Fundamenta Informaticae
- 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
- Degrees of Transducibility (2015)
- Lecture Notes in Computer Science
- On growth and fluctuation of k-abelian complexity (2015)
- Lecture Notes in Computer Science
- Systems of word equations, polynomials and linear algebra: A new approach (2015)
- European Journal of Combinatorics
- 5-Abelian cubes are avoidable on binary alphabets (2014)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
UTU Research Portal