Results 21 to 30 of about 67,579,596 (150)

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

Frequency-Hopping Sequences With Optimal Average Hamming Correlation and Their Applications in Energy and Spectrum Harvesting Technologies Area

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

Rich, Sturmian, and trapezoidal words [PDF]

, 2008
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite
Zamboni, L., Zamboni, Luca Q., De Luca, A., GLEN A., Glen, Amy, DE LUCA, ALDO, ZAMBONI L. Q., Glen, A.   +7 more
core   +1 more source

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

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., Amy Glen, Glen, Amy, Jacques Justin, Justin, Jacques, Glen, A.   +5 more
core   +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, Halunen Kimmo, Kortelainen Tuomas   +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, Sandi Klavžar, Jaehun Lee, Yoomi Rho   +3 more
doaj   +1 more source