Results 11 to 20 of about 70,377,857 (147)
Formalization of Basic Combinatorics on Words. [PDF]
, 2021 Combinatorics on Words is a rather young domain encompassing the study of words and formal languages. An archetypal example of a task in Combinatorics on Words is to solve the equation x ⋅ y = y ⋅ x, i.e., to describe words that commute. This contribution contains formalization of three important classical results in Isabelle/HOL.
Holub, Štěpán, Starosta, Štěpán
openaire +5 more sources
Digital Convexity and Combinatorics on Words [PDF]
An 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 0002 +2 more
openaire +6 more sources
Combinatorics of Compositions and Words
, 2009 A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used
Silvia Heubach, Toufik Mansour
openaire +2 more sources
Enumerative combinatorics on words
, 2015 Combinatorics on words is a field which has both historical roots and a substantial growth. Its roots are to be found in the early results of Axel Thue on square free words and the development of combinatorial group theory. The present interest in the field is pushed by its links with several connexions with other topics external to pure mathematics ...
Perrin, Dominique, Restivo, Antonio
core +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 4 th 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 +2 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