The following pages link to Aleksi Saarela (Q388737):
Displaying 42 items.
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821) (← links)
- Systems of word equations, polynomials and linear algebra: a new approach (Q1631611) (← links)
- Palindromic length in free monoids and free groups (Q1678354) (← links)
- Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\) (Q2221815) (← links)
- On abelian saturated infinite words (Q2326392) (← links)
- Separating many words by counting occurrences of factors (Q2327561) (← links)
- Independent systems of word equations: from Ehrenfeucht to eighteen (Q2333031) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- Word equations with \(k\)th powers of variables (Q2424902) (← links)
- On maximal chains of systems of word equations (Q2510762) (← links)
- Systems of word equations and polynomials: a new approach (Q2789531) (← links)
- Degrees of Infinite Words, Polynomials and Atoms (Q2817385) (← links)
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (Q2817399) (← links)
- Strongly k-Abelian Repetitions (Q2849986) (← links)
- Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants (Q2849992) (← links)
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (Q2921984) (← links)
- 5-Abelian cubes are avoidable on binary alphabets (Q2934279) (← links)
- Local Squares, Periodicity and Finite Automata (Q3003473) (← links)
- The Unique Decipherability in the Monoid of Regular Languages is Undecidable (Q3100936) (← links)
- Fine and Wilf’s Theorem for k-Abelian Periods (Q3167504) (← links)
- On Growth and Fluctuation of k-Abelian Complexity (Q3194711) (← links)
- Degrees of Transducibility (Q3449352) (← links)
- An Analysis and a Reproof of Hmelevskii’s Theorem (Q3533033) (← links)
- Ultimately constant abelian complexity of infinite words (Q3589628) (← links)
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
- Word Equations Where a Power Equals a Product of Powers (Q4636656) (← links)
- Degrees of Infinite Words, Polynomials and Atoms (Q4683233) (← links)
- One-Variable Word Equations and Three-Variable Constant-Free Word Equations (Q4683239) (← links)
- Studying Word Equations by a Method of Weighted Frequencies (Q4686537) (← links)
- Equivalence Relations Defined by Numbers of Occurrences of Factors (Q4976405) (← links)
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (Q5002823) (← links)
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (Q5026390) (← links)
- Separating the Words of a Language by Counting Factors (Q5158654) (← links)
- Unique decipherability in the additive monoid of sets of numbers (Q5198933) (← links)
- 3-Abelian Cubes Are Avoidable on Binary Alphabets (Q5300855) (← links)
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (Q5350153) (← links)
- (Q5414545) (← links)
- FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS (Q5495424) (← links)
- On the Solution Sets of Entire Systems of Word Equations (Q6134879) (← links)
- On the solution sets of three-variable word equations (Q6661760) (← links)
- A Connection Between Unbordered Partial Words and Sparse Rulers (Q6742202) (← links)
