๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Subword topology

โœ Scribed by V.Rajkumar Dare; Rani Siromoney

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
584 KB
Volume
47
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On subword complexity functions
On subword complexity functions
โœ Anni Sajo ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB
Sequences With Subword Complexity 2n
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 subwords of infinite words
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

On words containing all short subwords
On words containing all short subwords
โœ Ioan Tomescu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 317 KB

Lutz Priese raised the following conjecture: Almost all words of length n over a finite alphabet A with m letters contain as subwords all words of length [log log n] over A as n -+ co. In this note we prove that this property holds for subwords of length k(n) over A provided lim,, m k(n)/logn = 0.