Year: 2023
Type: preprint
Abstract: For any integer k ≥ 5, we show that a morphism that preserves k-power-free words also preserves (k + 1)-power-free words.
Source: HAL
Author: Wlazinski, Francis
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: morphisms, combinatorics on words
Open Access status: green
OpenAlex ID: W4390884660
