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

cloture

Combinatorics on Words978-3-031-33180-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

不如乐死去

干涉

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:

并置

Markku Mikkola,Ari Jussila,Tapani Ryynänene 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.

烧烤

Hatem Mahmoud,Prasanna Divigalpitiyancides 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.

AGOG

Susanne Schatzinger,Chyi Yng Rose Lim 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.

Incorporate

Alternate Base Numeration Systemsases periodically. Such systems naturally appear when considering linear numeration systems without a dominant root. As it happens, many classical results generalize to these numeration systems with multiple bases but some don’t. This is a survey of the work done so far concerning combinatorial, alg

Simulate

On the Number of Distinct Squares in Finite Sequences: Some Old and New Resultsed 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

上流社会

grotto

Longest Common Subsequence with Gap Constraintsonsider 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