Results 11 to 20 of about 73,359 (215)
Music and combinatorics on words: a historical survey [PDF]
Journal of Mathematics and Music - Mathematical and Computational Approaches to Music Theory, Analysis, Composition and Performance, 2018 In the preface of Lothaire’s book Combinatorics On Words first published in 1983, Dominique Perrin wrote: “It can be roughly said that automata theory (and formal language theory) deals with sets of words whereas combinatorics on words considers ...
Srečko Brlek +2 more
openalex +2 more sources
Fragmentary Fuzzy Pseudometrics: Basics of the Theory and Applications in Combinatorics on Words
Baltic Journal of Modern Computing, 2016 . By modifying the well-known concept of a fuzzy metric introduced in 1994 by A. George and P. Veeramani, we define the notion of a fragmentary fuzzy pseudometric.
Raivis Bēts, Alexander Šostak
openalex +2 more sources
Thue, Combinatorics on words, and conjectures inspired by the Thue-Morse sequence [PDF]
, 2015 Nous d\'ecrivons quelques r\'esultats r\'ecents sur la suite de Thue-Morse, ainsi que des questions ou conjectures, dont l'une, due \`a Shevelev, est r\'esolue dans cet article. We describe some recent results on the Thue-Morse sequence.
Jean‐Paul Allouche
openalex +3 more sources
Abelian combinatorics on words: A survey [PDF]
Computer Science Review, 2022 Gabriele Fici, Svetlana Puzynina
openalex +3 more sources
Combinatorics on words and generating Dirichlet series of automatic sequences [PDF]
Discrete MathematicsGenerating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than ordinary and exponential generating ...
Jean‐Paul Allouche +2 more
openalex +2 more sources
Formalization of Basic Combinatorics on Words
International Conference on Interactive Theorem Proving, 2021 Štěpán Holub, Štěpán Starosta
openalex +3 more sources
BWT and Combinatorics on Words [PDF]
The Expanding World of Compressed DataMélodie Lapointe +5 more
openalex +2 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
Combinatorics of minimal absent words for a sliding window [PDF]
Theoretical Computer Science, 2022 Tooru Akagi +6 more
openalex +2 more sources