✦ LIBER ✦

Partial words and a theorem of Fine and Wilf

✍ Scribed by Jean Berstel; Luc Boasson

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 413 KB
Volume: 218
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00255-2

No coin nor oath required. For personal study only.

✦ Synopsis

A partial word is a word that is a partial mapping into an alphabet. We prove a variant of Fine and Wilf's theorem for partial words, and give extensions of some general combinatorial properties of words.

📜 SIMILAR VOLUMES

Fine and Wilf's theorem for three period

Fine and Wilf's theorem for three periods and a generalization of Sturmian words

✍ M.Gabriella Castelli; Filippo Mignosi; Antonio Restivo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 700 KB

We extend the theorem of Fine and Wilf to words having three periods. We then define the set 3-PER of words of maximal length for which such result does not apply. We prove that the set 3-PER and the sequences of complexity 2n + 1, introduced by Amoux and Rauzy to generalize Sturmian words, have the

Isotropies of Partial Connections and a

Isotropies of Partial Connections and a Theorem of Morimoto

✍ H.R. Fischer; R.J. Fisher 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Partially ordered finite monoids and a t

Partially ordered finite monoids and a theorem of I. Simon

✍ Howard Straubing; Denis Thérien 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 415 KB

A further algebraic version of Cochran's

A further algebraic version of Cochran's theorem and matrix partial orderings

✍ Jerzy K. Baksalary; Jan Hauke 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 661 KB

A limit theorem for partial sums of rand

A limit theorem for partial sums of random variables and its applications

✍ Wen Liu; Jia-an Yan; Weiguo Yang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 131 KB

In this paper, we establish a new limit theorem for partial sums of random variables. As corollaries, we generalize the extended Borel-Cantelli lemma, and obtain some strong laws of large numbers for Markov chains as well as a generalized strong ergodic theorem for irreducible and positive recurrent

Cropper's question and Cruse's theorem a

Cropper's question and Cruse's theorem about partial Latin squares

✍ J. Goldwasser; A. J. W. Hilton; D. Patterson 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

In 1974 Cruse gave necessary and suf cient conditions for an r×s partial latin square P on symbols r 1 , r 2 ,...,r t , which may have some unfilled cells, to be completable to an n×n latin square on symbols r 1 , r 2 ,...,r n , subject to the condition that the unfilled cells of P must be lled with