[seqfan] Re: What is the name for a string that contains every k-digit base-b substring?

[allouche at math.jussieu.fr]

These sequences are called De Bruijn sequences
(see, e.g., http://en.wikipedia.org/wiki/De_Bruijn_sequence
where the strings are considered cyclic)
jpa

Charles Greathouse <charles.greathouse at case.edu> a écrit :

>> What is the name for a string that contains every k-digit base-b substring?
>
> For some b and every k, I've seen the term disjunctive sequence
> http://en.wikipedia.org/wiki/Disjunctive_sequence
> but I haven't seen a term for fixed k.
>
> Charles Greathouse
> Analyst/Programmer
> Case Western Reserve University
>
> On Mon, Mar 19, 2012 at 12:38 PM, Marc LeBrun <mlb at well.com> wrote:
>> What is the name for a string that contains every k-digit base-b substring?
>>
>> For example, with k=3 and b=10 this would be a string that contains every
>> three-digit decimal number as a substring.
>>
>> I'm interested in OEIS sequences related to this property (eg shortest,
>> number-of, etc) but need some idea what they are called to search on it!
>>
>> Thanks!
>>  --MLB
>>
>>
>>
>>
>> _______________________________________________
>>
>> Seqfan Mailing list - http://list.seqfan.eu/
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>