Aleksi Saarela

From MaRDI portal
Person:388737

Available identifiers

zbMath Open saarela.aleksiDBLP76/1604WikidataQ102410733 ScholiaQ102410733MaRDI QIDQ388737

List of research outcomes





PublicationDate of PublicationType
On the solution sets of three-variable word equations2025-01-13Paper
On the Solution Sets of Entire Systems of Word Equations2023-07-25Paper
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences2022-02-08Paper
Separating the Words of a Language by Counting Factors2021-10-25Paper
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences2021-07-28Paper
Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\)2021-02-02Paper
Independent systems of word equations: from Ehrenfeucht to eighteen2019-11-06Paper
Separating many words by counting occurrences of factors2019-10-15Paper
On abelian saturated infinite words2019-10-07Paper
Word equations with \(k\)th powers of variables2019-06-25Paper
Systems of word equations, polynomials and linear algebra: a new approach2018-12-06Paper
Studying Word Equations by a Method of Weighted Frequencies2018-10-02Paper
One-Variable Word Equations and Three-Variable Constant-Free Word Equations2018-09-20Paper
Degrees of Infinite Words, Polynomials and Atoms2018-09-20Paper
Word Equations Where a Power Equals a Product of Powers2018-04-19Paper
Palindromic length in free monoids and free groups2017-11-15Paper
On growth and fluctuation of \(k\)-abelian complexity2017-08-31Paper
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence2017-08-25Paper
Equivalence Relations Defined by Numbers of Occurrences of Factors2017-07-28Paper
Degrees of Infinite Words, Polynomials and Atoms2016-08-30Paper
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations2016-08-30Paper
Systems of word equations and polynomials: a new approach2016-03-01Paper
Degrees of Transducibility2015-11-04Paper
On Growth and Fluctuation of k-Abelian Complexity2015-10-20Paper
5-Abelian cubes are avoidable on binary alphabets2014-12-12Paper
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence2014-10-14Paper
FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS2014-08-04Paper
On maximal chains of systems of word equations2014-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54145452014-05-06Paper
On a generalization of abelian equivalence and complexity of infinite words2014-01-06Paper
Strongly k-Abelian Repetitions2013-09-20Paper
Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants2013-09-20Paper
3-Abelian Cubes Are Avoidable on Binary Alphabets2013-06-28Paper
Fine and Wilf’s Theorem for k-Abelian Periods2012-11-02Paper
Problems in between words and abelian words: \(k\)-abelian avoidability2012-10-11Paper
The Unique Decipherability in the Monoid of Regular Languages is Undecidable2011-11-22Paper
Unique decipherability in the additive monoid of sets of numbers2011-08-10Paper
Local Squares, Periodicity and Finite Automata2011-05-27Paper
https://portal.mardi4nfdi.de/entity/Q35896282010-09-20Paper
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations2009-07-07Paper
An Analysis and a Reproof of Hmelevskii’s Theorem2008-10-30Paper

Research outcomes over time

This page was built for person: Aleksi Saarela