Results 31 to 40 of about 70,377,857 (147)
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
, 2018 The first print magazine from 1000 Words. 2018 marks the 10th anniversary of 1000 Words, and what better way to celebrate than to publish a special print annual?
Clark, Tim, 1000 Words
core +5 more sources
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
Episturmian words: a survey [PDF]
, 2007 In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters.
Justin, J. +5 more
core +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
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
Quasiperiodic and Lyndon episturmian words [PDF]
, 2008 Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if, it is an infinite Lyndon word.
Amy Glen +5 more
core +1 more source