Results 1 to 10 of about 73,478 (174)
Abelian combinatorics on words: A survey [PDF]
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
semanticscholar +5 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 +9 more sources
Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet.
Juha Kortelainen
doaj +4 more sources
BPS counting for knots and combinatorics on words [PDF]
Journal of High Energy Physics, 2016 We discuss relations between quantum BPS invariants defined in terms of a product decomposition of certain series, and difference equations (quantum A-polynomials) that annihilate such series.
Kucharski, Piotr, Sułkowski, Piotr
core +4 more sources
Words, 2019 The abelian critical exponent of an infinite word $w$ is defined as the maximum ratio between the exponent and the period of an abelian power occurring in $w$. It was shown by Fici et al.
J. Peltomäki, Markus Alan Whiteland
openaire +2 more sources
String attractors and combinatorics on words [PDF]
, 2019 The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors.
Mantaci S. +4 more
core +5 more sources
Digital Convexity and Combinatorics on Words
WordsAn upward (resp. downward) digitally convex word is a binary word that best approximates from below (resp. from above) an upward (resp. downward) convex curve in the plane. We study these words from the combinatorial point of view, formalizing their geometric properties and highlighting connections with Christoffel words and finite Sturmian words.
Alessandro De Luca +2 more
openaire +5 more sources
BWT and Combinatorics on Words
The Expanding World of Compressed DataThe Burrows-Wheeler Transform (BWT) is a reversible transformation on words (strings) introduced in 1994 in the context of data compression, which is a permutation of the characters in the word. Its clustering effect, i.e., the remarkable property of grouping identical characters (BWT runs) when they share common contexts, has made it a powerful tool ...
Gabriele Fici +5 more
openaire +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
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