Minimal Complexities for Infinite Words Written with d Letters - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Minimal Complexities for Infinite Words Written with d Letters

Abstract

In this extended abstract, we discuss the minimal subword complexity and the minimal abelian complexity functions for infinite d-ary words. This leads us to answer a question of Rauzy from 1983: cubic billiard words are a good generalization of Sturmian words for the abelian complexity.
Fichier principal
Vignette du fichier
axviv_words23.pdf (300.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY - Attribution

Dates and versions

hal-04291983 , version 1 (21-11-2023)

Identifiers

Cite

Mélodie Andrieu, Léo Vivion. Minimal Complexities for Infinite Words Written with d Letters. Combinatorics on Words - 14th International Conference, WORDS, Jun 2023, Umeå, Sweden. pp.3--13, ⟨10.1007/978-3-031-33180-0_1⟩. ⟨hal-04291983⟩
47 View
21 Download

Altmetric

Share

Gmail Facebook X LinkedIn More