✦ LIBER ✦

On subword complexity functions

✍ Scribed by Anni Sajo

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 202 KB
Volume: 8
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90102-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sequences With Subword Complexity 2n

✍ G. Rote 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 716 KB

We construct and discuss infinite 0 - 1 -sequences which contain \(2 n\) different subwords of length \(n\), for every \(n . \quad\) ' 1994 Academic Press, Inc.

On the subword complexity of square-free

On the subword complexity of square-free DOL languages

✍ A. Ehrenfeucht; G. Rozenberg 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 890 KB

The complexity of functions on lattices

✍ J.W. Sander; R. Tijdeman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Let f : Z → {0; 1} be a given function. In 1938, Morse and Hedlund observed that if the number of distinct vectors (f(x + 1); : : : ; f(x + n)), x ∈ Z, called complexity, is at most n for some positive integer n, then f is periodic with period at most n. This result is best possible. Functions with

Subword topology

✍ V.Rajkumar Dare; Rani Siromoney 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 584 KB

On subwords of infinite words

✍ Lucian Ilie 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 175 KB

On subword decomposition and balanced po

On subword decomposition and balanced polynomials

✍ Yossi Moshe 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Let H (x) be a monic polynomial over a finite field F = GF(q). Denote by N a (n) the number of coefficients in H n which are equal to an element a ∈ F, and by G the set of elements a ∈ F × such that N a (n) > 0 for some n. We study the relationship between the numbers (N a (n)) a∈G and the patterns