Aleksi Saarela
PhD

Adjunct Professor, Department of Mathematics and Statistics (Department of Mathematics and Statistics)
Postdoctoral Researcher, Mathematics (Department of Mathematics and Statistics)

amsaar@utu.fi
+358 29 450 4315
+358 50 327 7291

Vesilinnantie 5
Turku
Quantum
Office: 395




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
Go to first page Go to previous page 1 of 2 Go to next page Go to last page

Word equations with kth powers of variables (2019)
Journal of Combinatorial Theory, Series A
Saarela Aleksi
(
A1 Journal article – refereed)

An optimal bound on the solution sets of one-variable word equations and its consequences (2018)
LIPICS – Leibniz international proceedings in informatics
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) Nowotka Dirk, Saarela Aleksi
(
A4 Article in conference proceedings)

Degrees of Infinite Words, Polynomials and Atoms (2018)
International Journal of Foundations of Computer Science
Endrullis J, Karhumaki J, Klop JW, Saarela A
(
A1 Journal article – refereed)

On abelian saturated infinite words (2018)
Theoretical Computer Science
Sergey Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
(
A1 Journal article – refereed)

One-Variable Word Equations and Three-Variable Constant-Free Word Equations (2018)
International Journal of Foundations of Computer Science
Nowotka D, Saarela A
(
A1 Journal article – refereed)

Studying Word Equations by a Method of Weighted Frequencies (2018)
Fundamenta Informaticae
Saarela A
(
A1 Journal article – refereed)

On growth and fluctuation of k-abelian complexity (2017)
European Journal of Combinatorics
Cassaigne J, Karhumaki J, Saarela A
(
A1 Journal article – refereed)

Palindromic length in free monoids and free groups (2017)
Lecture Notes in Computer Science
Combinatorics on Words: 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings Aleksi Saarela
(
A4 Article in conference proceedings)

Proceedings of the Fourth Russian Finnish Symposium on Discrete Mathematics (2017) Juhani Karhumäki, Yuri Matiyasevich, Aleksi Saarela
(
C2 Edited book)

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (2017)
Acta Cybernetica
Karhumaki J, Saarela A, Zamboni LQ
(
A1 Journal article – refereed)

Word equations where a power equals a product of powers (2017)
LIPICS – Leibniz international proceedings in informatics
Aleksi Saarela
(
A4 Article in conference proceedings)

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 Article in conference proceedings)

Equivalence Relations Defined by Numbers of Occurrences of Factors (2016)
Fundamenta Informaticae
Saarela Aleksi
(
A1 Journal article – refereed)

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 Article in conference proceedings)

Degrees of Transducibility (2015)
Lecture Notes in Computer Science
Combinatorics on Words Endrullis J, Klop JW, Saarela A, Whiteland M
(
A3 Book chapter)

On growth and fluctuation of k-abelian complexity (2015)
Lecture Notes in Computer Science
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
(
A4 Article in conference proceedings)

Systems of word equations, polynomials and linear algebra: A new approach (2015)
European Journal of Combinatorics
Aleksi Saarela
(
A1 Journal article – refereed)

5-Abelian cubes are avoidable on binary alphabets (2014)
RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
Mercas R, Saarela A
(
A1 Journal article – refereed)

Variations of the Morse-Hedlund theorem for k-abelian equivalence (2014)
Lecture Notes in Computer Science
Karhumäki J., Saarela A., Zamboni L.
(
A4 Article in conference proceedings)

3-abelian cubes are avoidable on binary alphabets (2013)
Lecture Notes in Computer Science
Developments in Language Theory Robert Mercas, Aleksi Saarela
(
A4 Article in conference proceedings)


Last updated on 2019-15-09 at 02:21