Results 21 to 30 of about 1,338,709 (133)
Properties of the extremal infinite smooth words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in nite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of
Srečko Brlek +2 more
doaj +3 more sources
Some Properties of the Quasi-Tribonacci Sequence
Mathematics, 2023 The quasi-Tribonacci sequence T, which is a transformation of the Tribonacci sequence, is the fixed point of morphism ϕ:0→01, 1→12, 2→0. In this paper, we study the properties of the factors in the quasi-Tribonacci sequence and give the singular ...
Jiemeng Zhang, Zhixiong Wen
doaj +1 more source
The height of the Lyndon tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We consider the set $\mathcal{L ...
Lucas Mercier, Philippe Chassaing
doaj +1 more source
2D Lyndon Words and Applications [PDF]
Algorithmica, 2015 A Lyndon word is a primitive string which is lexicographically smallest among cyclic permutations of its characters. Lyndon words are used for constructing bases in free Lie algebras, constructing de Bruijn sequences, finding the lexicographically smallest or largest substring in a string, and succinct suffix-prefix matching of highly periodic strings.
Shoshana Marcus, Dina Sokol
openaire +3 more sources
, 2020 1000 Words is a leading online contemporary photography magazine. It commissions and publishes exhibition and photo book reviews, essays and interviews in response to the visual culture of our present moment.
Clark, Tim, 1000 Words
core +6 more sources
Interactions between Digital Geometry and Combinatorics on Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We review some recent results in digital geometry obtained by using a combinatorics on words approach to discrete geometry. Motivated on the one hand by the well-known theory of Sturmian words which model conveniently discrete lines in the plane, and on ...
Srečko Brlek
doaj +1 more source
Algorithmic and combinatoric aspects of multiple harmonic sums [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Ordinary generating series of multiple harmonic sums admit a full singular expansion in the basis of functions $\{(1-z)^α \log^β (1-z)\}_{α ∈ℤ, β ∈ℕ}$, near the singularity $z=1$. A constructive proof of this result is given, and, by combinatoric aspects,
Christian Costermans +2 more
doaj +1 more source
Directive words of episturmian words: equivalences and normalization [PDF]
, 2008 Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms.
Amy Glen +8 more
core +1 more source
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Sturmian words, Lyndon words and trees
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berstel, Jean, de Luca, Aldo
openaire +5 more sources