We say a binary word is good if the only antisquares it contains are 01 and 10. We characterize the minimal antisquares, that is, those words that are antisquares but all proper …
G Badkobeh, P Ochem - arXiv preprint arXiv:2312.10757, 2023 - arxiv.org
An interesting phenomenon in combinatorics on words is when every recurrent word satisfying some avoidance constraints has the same factor set as a morphic word. An early …
P Ochem, D Opočenská - arXiv preprint arXiv:2311.13003, 2023 - arxiv.org
We study infinite binary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponents. This extends results by Fici and Zamboni …
We study the properties of the ternary infinite word p= 012102101021012101021012..., that is, the fixed point of the map h: 0-> 01, 1-> 21, 2-> 0. We determine its factor complexity …