Követés
Jarkko Peltomäki
Jarkko Peltomäki
Åbo Akademi University
E-mail megerősítve itt: turambar.org - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Introducing privileged words: Privileged complexity of Sturmian words
J Peltomäki
Theoretical Computer Science 500, 57-67, 2013
302013
Abelian powers and repetitions in Sturmian words
G Fici, A Langiu, T Lecroq, A Lefebvre, F Mignosi, J Peltomäki, ...
Theoretical Computer Science 635, 16-34, 2016
192016
Arch-comp 2023 category report: Falsification
C Menghi, P Arcaini, W Baptista, G Ernst, G Fainekos, F Formica, S Gon, ...
10th International Workshop on Applied Verification of Continuous and Hybrid …, 2023
162023
Wasserstein generative adversarial networks for online test generation for cyber physical systems
J Peltomäki, F Spencer, I Porres
Proceedings of the 15th Workshop on Search-Based Software Testing, 1-5, 2022
152022
Privileged Words and Sturmian Words
J Peltomäki
TUCS Dissertations No 214, 2016
152016
WOGAN at the SBST 2022 CPS tool competition
J Peltomäki, F Spencer, I Porres
Proceedings of the 15th Workshop on Search-Based Software Testing, 53-54, 2022
142022
Falsification of Multiple Requirements for Cyber-Physical Systems Using Online Generative Adversarial Networks and Multi-Armed Bandits
J Peltomäki, I Porres
2022 IEEE International Conference on Software Testing, Verification and …, 2022
132022
A square root map on Sturmian words
J Peltomäki, M Whiteland
Combinatorics on Words: 10th International Conference, WORDS 2015, Kiel …, 2015
132015
Automatic sequences based on Parry or Bertrand numeration systems
A Massuir, J Peltomäki, M Rigo
Advances in Applied Mathematics 108, 11-30, 2019
112019
Remarks on privileged words
M Forsyth, A Jayakumar, J Peltomäki, J Shallit
International Journal of Foundations of Computer Science 27 (04), 431-442, 2016
112016
Privileged factors in the Thue–Morse word—a comparison of privileged words and palindromes
J Peltomäki
Discrete Applied Mathematics 193, 187-199, 2015
102015
Characterization of repetitions in Sturmian words: A new proof
J Peltomäki
Information Processing Letters 115 (11), 886-891, 2015
82015
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
J Peltomäki
European Journal of Combinatorics 118, 103942, 2024
52024
Adaptive test generation for unmanned aerial vehicles using WOGAN-UAV
J Winsten, V Soloviev, J Peltomäki, I Porres
Proceedings of the 17th ACM/IEEE International Workshop on Search-Based and …, 2024
42024
Requirement falsification for cyber-physical systems using generative models
J Peltomäki, I Porres
arXiv preprint arXiv:2310.20493, 2023
42023
Every nonnegative real number is an abelian critical exponent
J Peltomäki, MA Whiteland
International Conference on Combinatorics on Words, 275-285, 2019
42019
On winning shifts of marked uniform substitutions
J Peltomäki, V Salo
RAIRO-Theoretical Informatics and Applications 53 (1-2), 51-66, 2019
42019
On -abelian Equivalence and Generalized Lagrange Spectra
J Peltomäki, MA Whiteland
arXiv preprint arXiv:1809.09047, 2018
42018
ARCH-COMP 2024 Category Report: Falsification
T Khandait, F Formica, P Arcaini, S Chotaliya, G Fainekos, A Hekal, ...
Proceedings of the 11th Int. Workshop on Applied 103, 122-144, 2024
32024
Avoiding abelian powers cyclically
J Peltomäki, MA Whiteland
Advances in Applied Mathematics 121, 102095, 2020
32020
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20