Aleksi Saarela

Available identifiers

zbMath Open saarela.aleksiWikidataQ102410733 ScholiaQ102410733MaRDI QIDQ388737

List of research outcomes

Publication	Date of Publication	Type
On the Solution Sets of Entire Systems of Word Equations	2023-07-25	Paper
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences	2022-02-08	Paper
Separating the Words of a Language by Counting Factors	2021-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q5002823	2021-07-28	Paper
Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\)	2021-02-02	Paper
Independent systems of word equations: from Ehrenfeucht to eighteen	2019-11-06	Paper
Separating many words by counting occurrences of factors	2019-10-15	Paper
On abelian saturated infinite words	2019-10-07	Paper
Word equations with \(k\)th powers of variables	2019-06-25	Paper
Systems of word equations, polynomials and linear algebra: a new approach	2018-12-06	Paper
Studying Word Equations by a Method of Weighted Frequencies	2018-10-02	Paper
Degrees of Infinite Words, Polynomials and Atoms	2018-09-20	Paper
One-Variable Word Equations and Three-Variable Constant-Free Word Equations	2018-09-20	Paper
https://portal.mardi4nfdi.de/entity/Q4636656	2018-04-19	Paper
Palindromic length in free monoids and free groups	2017-11-15	Paper
On growth and fluctuation of \(k\)-abelian complexity	2017-08-31	Paper
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence	2017-08-25	Paper
Equivalence Relations Defined by Numbers of Occurrences of Factors	2017-07-28	Paper
Degrees of Infinite Words, Polynomials and Atoms	2016-08-30	Paper
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations	2016-08-30	Paper
Systems of Word Equations and Polynomials: a New Approach	2016-03-01	Paper
Degrees of Transducibility	2015-11-04	Paper
On Growth and Fluctuation of k-Abelian Complexity	2015-10-20	Paper
5-Abelian cubes are avoidable on binary alphabets	2014-12-12	Paper
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence	2014-10-14	Paper
On maximal chains of systems of word equations	2014-08-04	Paper
FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS	2014-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5414545	2014-05-06	Paper
On a generalization of abelian equivalence and complexity of infinite words	2014-01-06	Paper
Strongly k-Abelian Repetitions	2013-09-20	Paper
Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants	2013-09-20	Paper
3-Abelian Cubes Are Avoidable on Binary Alphabets	2013-06-28	Paper
Fine and Wilf’s Theorem for k-Abelian Periods	2012-11-02	Paper
Problems in between words and abelian words: \(k\)-abelian avoidability	2012-10-11	Paper
The Unique Decipherability in the Monoid of Regular Languages is Undecidable	2011-11-22	Paper
Unique decipherability in the additive monoid of sets of numbers	2011-08-10	Paper
Local Squares, Periodicity and Finite Automata	2011-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q3589628	2010-09-20	Paper
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations	2009-07-07	Paper
An Analysis and a Reproof of Hmelevskii’s Theorem	2008-10-30	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Aleksi Saarela