Results 11 to 20 of about 2,178 (219)
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
BWT and Combinatorics on Words. [PDF]
The 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 +5 more sources
Combinatorics on Words: 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings [PDF]
, 2022 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.
Peltomäki Jarkko, Whiteland Markus A.
core +3 more sources
Theoretical Computer Science, 2011 Special issue of the journal Theoretical Computer Science dedicated to the Conference WORDS ...
CARPI, Arturo, De Felice C.
openaire +3 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 +1 more source
String Attractors and Combinatorics on Words [PDF]
CoRR, 2019 The notion of \emph{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. A string attractor for a word $w=w[1]w[2]\cdots w[n]$ is a subset $Γ$ of the positions $\{1,\ldots,n\}$, such that all distinct factors of $w$ have an ...
Mantaci S. +4 more
openaire +3 more sources
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words.
Guy Louchard +2 more
doaj +1 more source
Sweep maps for lattice paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Sweep maps are a family of maps on words that, while simple to define, are not yet known to be injective in general. This family subsumes many of the "zeta maps" that have arisen in the study of q,t-Catalan numbers in the course of relating the three ...
Nicholas Loehr, Gregory Warrington
doaj +1 more source
The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Automata, Logic and ...
Manfred Kufleitner, Alexander Lauser
doaj +1 more source