Introducing privileged words: Privileged complexity of Sturmian words. - Jarkko Peltomäki (Theor. Comput. Sci., 2013)

A Square Root Map on Sturmian Words - (Extended Abstract). - Jarkko Peltomäki; Markus A. Whiteland (WORDS, 2015)

Privileged factors in the Thue-Morse word - A comparison of privileged words and palindromes. - Jarkko Peltomäki (Discret. Appl. Math., 2015)

Characterization of repetitions in Sturmian words: A new proof. - Jarkko Peltomäki (Inf. Process. Lett., 2015)

Remarks on Privileged Words. - Michael Forsyth; Amlesh Jayakumar; Jarkko Peltomäki; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2016)

Abelian powers and repetitions in Sturmian words. - Gabriele Fici; Alessio Langiu; Thierry Lecroq; Arnaud Lefebvre; Filippo Mignosi; Jarkko Peltomäki; Élise Prieur-Gaston (Theor. Comput. Sci., 2016)

More on the Dynamics of the Symbolic Square Root Map - (Extended Abstract). - Jarkko Peltomäki; Markus A. Whiteland (WORDS, 2017)

A Square Root Map on Sturmian Words. - Jarkko Peltomäki; Markus A. Whiteland (Electron. J. Comb., 2017)

On k-abelian Equivalence and Generalized Lagrange Spectra. - Jarkko Peltomäki; Markus A. Whiteland (CoRR, 2018)

Every Nonnegative Real Number Is an Abelian Critical Exponent. - Jarkko Peltomäki; Markus A. Whiteland (WORDS, 2019)

Automatic sequences based on Parry or Bertrand numeration systems. - Adeline Massuir; Jarkko Peltomäki; Michel Rigo (Adv. Appl. Math., 2019)

Abelian periods of factors of Sturmian words. - Jarkko Peltomäki (CoRR, 2019)

On winning shifts of marked uniform substitutions. - Jarkko Peltomäki; Ville Salo (RAIRO Theor. Informatics Appl., 2019)

All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words. - Jarkko Peltomäki; Markus A. Whiteland (MFCS, 2020)

Avoiding abelian powers cyclically. - Jarkko Peltomäki; Markus A. Whiteland (Adv. Appl. Math., 2020)

Standard words and solutions of the word equation $X_1^2 dotsm X_n^2 = (X_1 dotsm X_n)^2$. - Jarkko Peltomäki; Aleksi Saarela (CoRR, 2020)

More on the dynamics of the symbolic square root map. - Jarkko Peltomäki; Markus A. Whiteland (Theor. Comput. Sci., 2020)

Standard words and solutions of the word equation X12⋯Xn2=(X1⋯Xn)2. - Jarkko Peltomäki; Aleksi Saarela (J. Comb. Theory A, 2021)

On prefix palindromic length of automatic words. - Anna E. Frid; Enzo Laborde; Jarkko Peltomäki (Theor. Comput. Sci., 2021)

Falsification of Multiple Requirements for Cyber-Physical Systems Using Online Generative Adversarial Networks and Multi-Armed Bandits. - Jarkko Peltomäki; Ivan Porres (ICST Workshops, 2022)

Wasserstein Generative Adversarial Networks for Online Test Generation for Cyber Physical Systems. - Jarkko Peltomäki; Frankie Spencer; Ivan Porres (SBST@ICSE, 2022)

WOGAN at the SBST 2022 CPS Tool Competition. - Jarkko Peltomäki; Frankie Spencer; Ivan Porres (SBST@ICSE, 2022)

Automatic winning shifts. - Jarkko Peltomäki; Ville Salo (Inf. Comput., 2022)

ARCH-COMP23 Category Report: Falsification. - Claudio Menghi; Paolo Arcaini; Walstan Baptista; Gidon Ernst; Georgios Fainekos; Federico Formica; Sauvik Gon; Tanmay Khandait; Atanu Kundu 002; Giulia Pedrielli; Jarkko Peltomäki; Ivan Porres; et al. (ARCH, 2023)

SBFT Tool Competition 2023 - Cyber-Physical Systems Track. - Matteo Biagiola; Stefan Klikovits; Jarkko Peltomäki; Vincenzo Riccio (SBFT, 2023)

Testing cyber-physical systems with explicit output coverage. - Jarkko Peltomäki; Jesper Winsten; Maxime Methais; Ivan Porres (ICSTW, 2024)

Adaptive Test Generation for Unmanned Aerial Vehicles using WOGAN-UAV. - Jesper Winsten; Valentin Soloviev; Jarkko Peltomäki; Ivan Porres (SBFT@ICSE, 2024)

Learning test generators for cyber-physical systems. - Jarkko Peltomäki; Ivan Porres (CoRR, 2024)

Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents. - Jarkko Peltomäki (Eur. J. Comb., 2024)

The Repetition Threshold for Ternary Rich Words. - James D. Currie; Lucas Mol; Jarkko Peltomäki (Electron. J. Comb., 2025)

Requirement falsification for cyber-physical systems using generative models. - Jarkko Peltomäki; Ivan Porres (Autom. Softw. Eng., 2025)