Titlebook: Combinatorics on Words; 14th International C Anna Frid,Robert Merca? Conference proceedings 2023 The Editor(s) (if applicable) and The Auth

會議

String Attractors for?Factors of?the?Thue-Morse Worde extend their result by constructing a smallest string attractor for any given factor of the Thue-Morse word. In particular, we show that these string attractors have size at most 5 and that this upper bound is sharp.

繼承人

Critical Exponents of?Regular Arnoux-Rauzy Sequencesncides with a well-known formula for Sturmian sequences based on their S-adic representation. We show that among regular .-ary Arnoux-Rauzy sequences, the minimal (asymptotic) critical exponent is reached by the .-bonacci sequence.

梯田

Order Conditions for?Languages of a generalized interval exchange transformation, while the order condition plus some additional ones characterize the codings of various more classical interval exchange transformations. Also, a finite word clusters for the Burrows-Wheeler transform if and only if the language generated by its powers satisfies an order condition.

暫停,間歇

Veneer

Co-Product Recovery in Food Processinged by Fraenkel and Simpson in 1998. They proved that the number of distinct squares, denoted as ., in a finite word . of length . is upper bounded by 2. and conjectured that . is no larger than .. In this note, we review some old and new findings concerning the square-counting problem and prove that

MAUVE

https://doi.org/10.1007/978-3-319-75774-2. appears in . as a subsequence. In this paper, we provide new algorithms for .-subsequence universal words of fixed length . over the alphabet .. Letting . denote the set of .-length .-subsequence universal words over ., we provide:

CRATE

https://doi.org/10.1007/978-3-319-75774-2onsider the setting when the distance (i.?e., the gap) between two consecutive symbols of the subsequence has to be between a lower and an upper bound (which may depend on the position of those symbols in the subsequence or on the symbols bordering the gap) as well as the case where the entire subse

Exclude

I?igo Lorente-Riverola,Javier Ruiz-Sánchezthe property asking that the image of the return set to a word equals the return set to the image of that word. We show that, for bifix encodings (where images of letters form a bifix code), this property holds for all but finitely many words. On the other hand, we also show that every conjugacy cla

消散

中止

Ezio Micelli,Alessia Mangialardo there is at least one. We introduce a method using desubstitution of .-automata to describe the structure of preimages of accepted words under arbitrary sequences of homomorphisms: this takes the form of a meta-.-automaton..We decide the existence of an accepted purely substitutive word, as well as