20 citations · 35 across the 8 of their papers we have counts for
10 papers
Requirement falsification for cyber-physical systems using generative models
Jarkko Peltomäki, Ivan Porres
We present the OGAN algorithm for automatic requirement falsification of cyber-physical systems. System inputs and outputs are represented as piecewise constant signals over time w…
Automatic winning shifts
Jarkko Peltomäki, Ville Salo
To each one-dimensional subshift , we may associate a winning shift which arises from a combinatorial game played on the language of . Previously it has been studied w…
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
Jarkko Peltomäki
Regular episturmian words are episturmian words whose directive words have a regular and restricted form making them behave more like Sturmian words than general episturmian words.…
On prefix palindromic length of automatic words
Anna E. Frid, Enzo Laborde, Jarkko Peltomäki
The prefix palindromic length of an infinite word is the minimal number of concatenated palindromes needed to express the prefix of leng…
On winning shifts of marked uniform substitutions
Jarkko Peltomäki, Ville Salo
The second author introduced with I. Törmä a two-player word-building game [Playing with Subshifts, Fund. Inform. 132 (2014), 131--152]. The game has a predetermined (possibly fini…
A square root map on Sturmian words
Jarkko Peltomäki, Markus Whiteland
We introduce a square root map on Sturmian words and study its properties. Given a Sturmian word of slope , there exists exactly six minimal squares in its language (a minimal s…
Abelian Powers and Repetitions in Sturmian Words
Gabriele Fici, Alessio Langiu, Thierry Lecroq +4
Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent for every . We imp…
Characterization of repetitions in Sturmian words: A new proof
Jarkko Peltomäki
We present a new, dynamical way to study powers (that is, repetitions) in Sturmian words based on results from Diophantine approximation theory. As a result, we provide an alternat…
Remarks on Privileged Words
Michael Forsyth, Amlesh Jayakumar, Jeffrey Shallit
We discuss the notion of privileged word, recently introduced by Peltomaki. A word w is privileged if it is of length <=1, or has a privileged border that occurs exactly twice in w…
Introducing Privileged Words: Privileged Complexity of Sturmian Words
Jarkko Peltomäki
In this paper we study the class of so-called privileged words which have been previously considered only a little. We develop the basic properties of privileged words, which turn…