20 citations · 35 across the 8 of their papers we have counts for
5 papers · 1 filter
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…
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…