Titlebook: Combinatorics on Words; 13th International C Thierry Lecroq,Svetlana Puzynina Conference proceedings 2021 Springer Nature Switzerland AG 20

Bouquet

https://doi.org/10.1007/978-1-4302-0254-7We study balanced sequences over a .-letter alphabet. Each such sequence . is described by a Sturmian sequence and two constant gap sequences . and .. We provide an algorithm which for a given ., . and a quadratic slope of a Sturmian sequence computes the critical exponent of the balanced sequence ..

Hangar

确定的事

Assessment of BEVs Use in Urban EnvironmentAn efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length . over the alphabet . is presented.

investigate

Smart and Healthy Walking in Smart Cities,An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finite Lyndon words as prefixes. A characterization of binary endomorphisms generating Lyndon infinite words is provided.

攀登

Computation of Critical Exponent in Balanced Sequences,We study balanced sequences over a .-letter alphabet. Each such sequence . is described by a Sturmian sequence and two constant gap sequences . and .. We provide an algorithm which for a given ., . and a quadratic slope of a Sturmian sequence computes the critical exponent of the balanced sequence ..

金桌活画面

AGONY

禁止

Coma704

鲁莽