Results 11 to 20 of about 1,252 (172)
Abelian combinatorics on words: A survey
Computer Science Review, 2023 We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension is based on \emph{abelian equivalence}, which is the equivalence relation defined in the set of words by having the same Parikh vector ...
Gabriele Fici, Svetlana Puzynina
exaly +3 more sources
The origins of combinatorics on words
European Journal of Combinatorics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dominique Perrin
exaly +4 more sources
On the combinatorics of finite words
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aldo De Luca
exaly +4 more sources
Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words [PDF]
Journal of Universal Computer Science, 2023 A bordered box repetition-free word is a finite word w where any given factor of the form asa, with a ∈ Σ and s ∈ Σ∗, occurs at most once.
Trienko Grobler +3 more
doaj +3 more sources
Gray code order for Lyndon words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 At the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed the question of whether the dual reflected order yields a Gray code on the Lyndon family. In this paper we give a positive answer.
Vincent Vajnovszki
doaj +3 more sources
Mathematics, 2023 We generalize the concept of a fuzzy metric by introducing its approximating counterpart in order to make it more appropriate for the study of some problems related to combinatorics on words.
Raivis Bēts, Alexander Šostak
doaj +1 more source
Almost Optimal Searching of Maximal Subrepetitions in a Word
Mathematics, 2022 For some fixed δ such that ...
Roman Kolpakov
doaj +1 more source
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
Prefixes of the Fibonacci word that end with a cube
Comptes Rendus. Mathématique, 2023 The Fibonacci word $\mathbf{f} = 010010100100101\cdots $ is one of the most well-studied words in the area of combinatorics on words. It is not periodic, but nevertheless contains many highly periodic factors (contiguous subwords).
Rampersad, Narad
doaj +1 more source