مرکز منطقه ای اطلاع رساني علوم و فناوري - Sequences With Subword Complexity 2n Original Research Article

Title of article :

Sequences With Subword Complexity 2n Original Research Article

Author/Authors :

Rote G.، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 1994

Pages :

From page :

196

To page :

213

Abstract :

We construct and discuss infinite 0-1-sequences which contain 2n different sub-words of length n, for every n.

Journal title :

Journal of Number Theory

Serial Year :

1994

Journal title :

Journal of Number Theory

Record number :

714285

Link To Document :