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.
2 of 3
- 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
- Variations of the Morse-Hedlund theorem for k-abelian equivalence (2014)
- Lecture Notes in Computer Science
- 3-abelian cubes are avoidable on binary alphabets (2013)
- Lecture Notes in Computer Science
- Fine and Wilf's theorem for k-abelian periods (2013)
- International Journal of Foundations of Computer Science
- On a generalization of Abelian equivalence and complexity of infinite words (2013)
- Journal of Combinatorial Theory, Series A
- Strongly k-abelian repetitions (2013)
- Lecture Notes in Computer Science
- Weakly unambiguous morphisms with respect to sets of patterns with constants (2013)
- Lecture Notes in Computer Science
- 5-abelian cubes are avoidable on binary alphabets (2012) Robert Mercas, Aleksi Saarela
- 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
- Problems in between words and abelian words: k-abelian avoidability (2012)
- Theoretical Computer Science
- Word Equations and Related Topics: Independence, Decidability and Characterizations (2012) Saarela A
- Local squares, periodicity and finite automata (2011)
- Lecture Notes in Computer Science
- On maximal chains of systems of word equations (2011)
- Proceedings of the Steklov Institute of Mathematics
- Systems of word equations and polynomials: a new approach (2011) Proceedings of the 8th International Conference WORDS Saarela A
UTU Research Portal