Aleksi Saarela

Publication Activity (10 Years)

Years Active: 2008-2023
Publications (10 Years): 26

Top Topics

Equivalence Relation

Top Venues

Fundam. Informaticae

J. Comb. Theory, Ser. A

Publications

Aleksi Saarela
On the Solution Sets of Entire Systems of Word Equations. WORDS (2023)
Dirk Nowotka, Aleksi Saarela
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. SIAM J. Comput. 51 (1) (2022)
Aleksi Saarela
Separating the Words of a Language by Counting Factors. Fundam. Informaticae 180 (4) (2021)
Jarkko Peltomäki, Aleksi Saarela
Standard words and solutions of the word equation X12⋯Xn2=(X1⋯Xn)2. J. Comb. Theory, Ser. A 178 (2021)
Jarkko Peltomäki, Aleksi Saarela
Standard words and solutions of the word equation $X_1^2 \dotsm X_n^2 = (X_1 \dotsm X_n)^2$. CoRR (2020)
Aleksi Saarela
Hardness Results for Constant-Free Pattern Languages and Word Equations. ICALP (2020)
Aleksi Saarela
th powers of variables. J. Comb. Theory, Ser. A 165 (2019)
Aleksi Saarela
Separating Many Words by Counting Occurrences of Factors. DLT (2019)
Aleksi Saarela
Separating many words by counting occurrences of factors. CoRR (2019)
Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
On abelian saturated infinite words. Theor. Comput. Sci. 792 (2019)
Aleksi Saarela
Independent Systems of Word Equations: From Ehrenfeucht to Eighteen. WORDS (2019)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials and Atoms. Int. J. Found. Comput. Sci. 29 (5) (2018)
Aleksi Saarela
Studying Word Equations by a Method of Weighted Frequencies. Fundam. Informaticae 162 (2-3) (2018)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR (2018)
Dirk Nowotka, Aleksi Saarela
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. ICALP (2018)
Dirk Nowotka, Aleksi Saarela
One-Variable Word Equations and Three-Variable Constant-Free Word Equations. Int. J. Found. Comput. Sci. 29 (5) (2018)
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
On growth and fluctuation of k-abelian complexity. Eur. J. Comb. 65 (2017)
Aleksi Saarela
Word Equations Where a Power Equals a Product of Powers. STACS (2017)
Aleksi Saarela
Palindromic Length in Free Monoids and Free Groups. WORDS (2017)
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
-Abelian Equivalence. Acta Cybern. 23 (1) (2017)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials and Atoms. DLT (2016)
Dirk Nowotka, Aleksi Saarela
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations. DLT (2016)
Aleksi Saarela
Equivalence Relations Defined by Numbers of Occurrences of Factors. Fundam. Informaticae 145 (3) (2016)
Aleksi Saarela
Systems of word equations, polynomials and linear algebra: A new approach. Eur. J. Comb. 47 (2015)
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
On Growth and Fluctuation of k-Abelian Complexity. CSR (2015)
Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland
Degrees of Transducibility. WORDS (2015)
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Developments in Language Theory (2014)
Aleksi Saarela
Systems of word equations, polynomials and linear algebra: A new approach. CoRR (2014)
Robert Mercas, Aleksi Saarela
5-Abelian cubes are avoidable on binary alphabets. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
Fine and Wilf's Theorem for k-Abelian Periods. Int. J. Found. Comput. Sci. 24 (7) (2013)
Aleksi Saarela
Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants. WORDS (2013)
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
On a generalization of Abelian equivalence and complexity of infinite words. J. Comb. Theory, Ser. A 120 (8) (2013)
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
On a generalization of Abelian equivalence and complexity of infinite words CoRR (2013)
Robert Mercas, Aleksi Saarela
3-Abelian Cubes Are Avoidable on Binary Alphabets. Developments in Language Theory (2013)
Mari Huova, Aleksi Saarela
Strongly k-Abelian Repetitions. WORDS (2013)
Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
Fine and Wilf's Theorem for k-Abelian Periods. Developments in Language Theory (2012)
Mari Huova, Juhani Karhumäki, Aleksi Saarela
Problems in between words and abelian words: k-abelian avoidability. Theor. Comput. Sci. 454 (2012)
Juhani Karhumäki, Aleksi Saarela
The Unique Decipherability in the Monoid of Regular Languages is Undecidable. Fundam. Informaticae 110 (1-4) (2011)
Aleksi Saarela
Unique decipherability in the additive monoid of sets of numbers. RAIRO Theor. Informatics Appl. 45 (2) (2011)
Aleksi Saarela
Systems of Word Equations and Polynomials: a New Approach WORDS (2011)
Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari
Local Squares, Periodicity and Finite Automata. Rainbow of Computer Science (2011)
Juhani Karhumäki, Aleksi Saarela
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms. Discret. Math. Theor. Comput. Sci. 12 (4) (2010)
Aleksi Saarela
Ultimately Constant Abelian Complexity of Infinite Words. J. Autom. Lang. Comb. 14 (3/4) (2009)
Aleksi Saarela
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations. Developments in Language Theory (2009)
Aleksi Saarela, Jan-Erik Ekberg, Kaisa Nyberg
Random Beacon for Privacy and Group Security. WiMob (2008)
Juhani Karhumäki, Aleksi Saarela
An Analysis and a Reproof of Hmelevskii's Theorem. Developments in Language Theory (2008)