20 citations · 35 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.FL2021
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…
cs.FL2021★ 2 cited
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.…