Results 21 to 30 of about 1,252 (172)
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
Topics in Cognitive Science, EarlyView., 2023 Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley +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
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
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