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
Combinatorics of minimal absent words for a sliding window [PDF]
Theoretical Computer Science, 2021 A string $w$ is called a minimal absent word (MAW) for another string $T$ if $w$ does not occur in $T$ but the proper substrings of $w$ occur in $T$. For example, let $\Sigma = \{\mathtt{a, b, c}\}$ be the alphabet. Then, the set of MAWs for string $w = \
Tooru Akagi +6 more
semanticscholar +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
Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks [PDF]
, 2020 The main goal of this article is to present a direct approach for the formula giving the long-term apparent hashrates of Selfish Mining strategies using only elementary probabilities and combinatorics, more precisely, Dyck words.
Grunspan, Cyril
core +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
On morphisms preserving infinite Lyndon words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words.
Gwenael Richomme
doaj +1 more source
Subproduct systems and Cartesian systems; new results on factorial languages and their relations with other areas [PDF]
, 2020 We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language).
Gerhold, Malte, Skeide, Michael
core +3 more sources
Ohne Frage? Mit Sicherheit. Präpositionale Wortverbindungen als Ausdrucksformen der Sprechereinstellung / Ohne Frage? Mit Sicherheit. Preposition-noun Phrases as Expressive Form of Speaker Attitude [PDF]
Linguistische Treffen in Wrocław, 2020 Usualisierte Mehrworteinheiten stellen ein breites, strukturell und semantisch sehr heterogenes Spektrum von sprachlichen Elementen dar. Das Thema des Beitrags fokussiert die Problematik der lexikalisch-syntagmatischen Kombinatorik von usuellen ...
Monika Hornáček Banášová
doaj +1 more source
IEEE Access, 2021 The research of cyclotomy theory can be traced to Gauss and it has been applied to many fields such as cryptography, coding theory, and combinatorics. According to $v$ prime numbers or compound words, the incision on the residue-like ring ${\mathbb Z ...
Mingyue Fan
doaj +1 more source
How often do we reject a superior value? (Extended abstract) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Words $a_1 a_2 \ldots a_n$ with independent letters $a_k$ taken from the set of natural numbers, and a weight (probability) attached via the geometric distribution $pq^{i-1}(p+q=1)$ are considered.
Kamilla Oliver, Helmut Prodinger
doaj +1 more source