Jarkko Peltomäki
1 of 3
- Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents (2024)
- European Journal of Combinatorics
- Automatic winning shifts (2022)
- Information and Computation
- On prefix palindromic length of automatic words (2021)
- Theoretical Computer Science
- Standard words and solutions of the word equation X_1^2 ··· X_n^2 = (X_1 ··· X_n)^2 (2021)
- Journal of Combinatorial Theory, Series A
- Abelian periods of factors of Sturmian words (2020)
- Journal of Number Theory
- All growth rates of abelian exponents are attained by infinite binary words (2020)
- LIPICS – Leibniz International Proceedings in Informatics
- Avoiding abelian powers cyclically (2020)
- Advances in Applied Mathematics
- More on the dynamics of the symbolic square root map (2020)
- Theoretical Computer Science
- On k-abelian equivalence and generalized Lagrange spectra (2020)
- Acta Arithmetica
- Automatic sequences based on Parry or Bertrand numeration systems (2019)
- Advances in Applied Mathematics
UTU Research Portal