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
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
On the Entropy of a Two Step Random Fibonacci Substitution
Entropy, 2013 We consider a random generalization of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping, a → baa and b → ab, with probability , and → ba, with probability 1 – p for 0 < p < 1, and where the random rule is
Johan Nilsson
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
Multicollision attacks and generalized iterated hash functions
Journal of Mathematical Cryptology, 2010 We apply combinatorics on words to develop an approach to multicollisions in generalized iterated hash functions. Our work is based on the discoveries of A. Joux and on generalizations provided by M. Nandi and D. Stinson as well as J. Hoch and A. Shamir.
Kortelainen Juha +2 more
doaj +1 more source
Analysis of the multiplicity matching parameter in suffix trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion.
Mark Daniel Ward, Wojciech Szpankowski
doaj +1 more source
Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Jernej Azarija +3 more
doaj +1 more source
Counting words with Laguerre polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials.
Jair Taylor
doaj +1 more source
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source