Aleksi Saarela

According to our database, Aleksi Saarela authored at least 39 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the Solution Sets of Entire Systems of Word Equations.

Aleksi Saarela

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences.

Dirk Nowotka, Aleksi Saarela

SIAM J. Comput., 2022

2021

Standard words and solutions of the word equation X12⋯Xn2=(X1⋯Xn)2.

Jarkko Peltomäki, Aleksi Saarela

J. Comb. Theory, Ser. A, 2021

Separating the Words of a Language by Counting Factors.

Aleksi Saarela

Fundam. Informaticae, 2021

2020

Standard words and solutions of the word equation $X_1^2 \dotsm X_n^2 = (X_1 \dotsm X_n)^2$.

Jarkko Peltomäki, Aleksi Saarela

CoRR, 2020

Hardness Results for Constant-Free Pattern Languages and Word Equations.

Aleksi Saarela

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

On abelian saturated infinite words.

Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela

Theor. Comput. Sci., 2019

Word equations with <i>k</i>th powers of variables.

Aleksi Saarela

J. Comb. Theory, Ser. A, 2019

Separating Many Words by Counting Occurrences of Factors.

Aleksi Saarela

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

Independent Systems of Word Equations: From Ehrenfeucht to Eighteen.

Aleksi Saarela

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

One-Variable Word Equations and Three-Variable Constant-Free Word Equations.

Dirk Nowotka, Aleksi Saarela

Int. J. Found. Comput. Sci., 2018

Degrees of Infinite Words, Polynomials and Atoms.

Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela

Int. J. Found. Comput. Sci., 2018

Studying Word Equations by a Method of Weighted Frequencies.

Aleksi Saarela

Fundam. Informaticae, 2018

Degrees of Infinite Words, Polynomials, and Atoms (Extended Version).

Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela

CoRR, 2018

2017

On growth and fluctuation of k-abelian complexity.

Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela

Eur. J. Comb., 2017

Variations of the Morse-Hedlund Theorem for <i>k</i>-Abelian Equivalence.

Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni

Acta Cybern., 2017

Word Equations Where a Power Equals a Product of Powers.

Aleksi Saarela

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Palindromic Length in Free Monoids and Free Groups.

Aleksi Saarela

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Equivalence Relations Defined by Numbers of Occurrences of Factors.

Aleksi Saarela

Fundam. Informaticae, 2016

One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations.

Dirk Nowotka, Aleksi Saarela

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

Systems of word equations, polynomials and linear algebra: A new approach.

Aleksi Saarela

Eur. J. Comb., 2015

Degrees of Transducibility.

Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

5-Abelian cubes are avoidable on binary alphabets.

Robert Mercas, Aleksi Saarela

RAIRO Theor. Informatics Appl., 2014

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.

Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

On a generalization of Abelian equivalence and complexity of infinite words.

Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni

J. Comb. Theory, Ser. A, 2013

Fine and Wilf's Theorem for k-Abelian Periods.

Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela

Int. J. Found. Comput. Sci., 2013

3-Abelian Cubes Are Avoidable on Binary Alphabets.

Robert Mercas, Aleksi Saarela

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants.

Aleksi Saarela

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

Strongly k-Abelian Repetitions.

Mari Huova, Aleksi Saarela

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Problems in between words and abelian words: k-abelian avoidability.

Mari Huova, Juhani Karhumäki, Aleksi Saarela

Theor. Comput. Sci., 2012

2011

Unique decipherability in the additive monoid of sets of numbers.

Aleksi Saarela

RAIRO Theor. Informatics Appl., 2011

The Unique Decipherability in the Monoid of Regular Languages is Undecidable.

Juhani Karhumäki, Aleksi Saarela

Fundam. Informaticae, 2011

Systems of Word Equations and Polynomials: a New Approach

Aleksi Saarela

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Local Squares, Periodicity and Finite Automata.

Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari

Proceedings of the Rainbow of Computer Science, 2011

2010

Noneffective Regularity of Equality Languages and Bounded Delay Morphisms.

Juhani Karhumäki, Aleksi Saarela

Discret. Math. Theor. Comput. Sci., 2010

2009

Ultimately Constant Abelian Complexity of Infinite Words.

Aleksi Saarela

J. Autom. Lang. Comb., 2009

On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations.

Aleksi Saarela

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Random Beacon for Privacy and Group Security.

Aleksi Saarela, Jan-Erik Ekberg, Kaisa Nyberg

Proceedings of the IEEE International Conference on Wireless and Mobile Computing, 2008

An Analysis and a Reproof of Hmelevskii's Theorem.

Juhani Karhumäki, Aleksi Saarela

Proceedings of the Developments in Language Theory, 12th International Conference, 2008