Results 21 to 30 of about 2,178 (219)
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 +8 more
core +2 more sources
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
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. +7 more
core +2 more sources
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
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 +2 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
Directive words of episturmian words: equivalences and normalization [PDF]
, 2008 Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms.
Amy Glen +8 more
core +2 more sources
Conjugates of characteristic Sturmian words generated by morphisms [PDF]
, 2004 This article is concerned with characteristic Sturmian words of slope α and 1-α (denoted by cα and c1-α resp.), where α∈(0,1) is an irrational number such that α=[0;1+d1,d2,..., dn] with dn≥d1≥1.
Glen, Amy +3 more
core +2 more sources