24 citations · 37 across the 7 of their papers we have counts for
9 papers
Learning test generators for cyber-physical systems
Jarkko Peltomäki, Ivan Porres
Black-box runtime verification methods for cyber-physical systems can be used to discover errors in systems whose inputs and outputs are expressed as signals over time and their co…
The repetition threshold for ternary rich words
James D. Currie, Lucas Mol, Jarkko Peltomäki
In 2017, Vesti proposed the problem of determining the repetition threshold for infinite rich words, i.e., for infinite words in which all factors of length contain distinc…
Wasserstein Generative Adversarial Networks for Online Test Generation for Cyber Physical Systems
Jarkko Peltomäki, Frankie Spencer, Ivan Porres
We propose a novel online test generation algorithm WOGAN based on Wasserstein Generative Adversarial Networks. WOGAN is a general-purpose black-box test generator applicable to an…
Avoiding abelian powers cyclically
Jarkko Peltomäki, Markus A. Whiteland
We study a new notion of cyclic avoidance of abelian powers. A finite word avoids abelian -powers cyclically if for each abelian -power of period occurring in the inf…
Standard words and solutions of the word equation
Jarkko Peltomäki, Aleksi Saarela
We consider solutions of the word equation such that the squares are minimal squares found in optimal squareful infinite words. We…
Every nonnegative real number is an abelian critical exponent
Jarkko Peltomäki, Markus A. Whiteland
The abelian critical exponent of an infinite word is defined as the maximum ratio between the exponent and the period of an abelian power occurring in . It was shown by Fici…
Automatic sequences based on Parry or Bertrand numeration systems
Adeline Massuir, Jarkko Peltomäki, Michel Rigo
We study the factor complexity and closure properties of automatic sequences based on Parry or Bertrand numeration systems. These automatic sequences can be viewed as generalizatio…
On -abelian Equivalence and Generalized Lagrange Spectra
Jarkko Peltomäki, Markus A. Whiteland
We study the set of -abelian critical exponents of all Sturmian words. It has been proven that in the case this set coincides with the Lagrange spectrum. Thus the sets o…
More on the dynamics of the symbolic square root map
Jarkko Peltomäki, Markus Whiteland
In our earlier paper [A square root map on Sturmian words, Electron. J. Combin. 24.1 (2017)], we introduced a symbolic square root map. Every optimal squareful infinite word co…