Volume 218; Issue 1

Theoretical Computer Science

Volume 218; Issue 1
1

Preface

Year:
1999
Language:
english
File:
PDF, 64 KB
english, 1999
2

Limit values of the recurrence quotient of Sturmian sequences

Year:
1999
Language:
english
File:
PDF, 678 KB
english, 1999
3

On the combinatorics of finite words

Year:
1999
Language:
english
File:
PDF, 1.49 MB
english, 1999
4

Lyndon words and singular factors of Sturmian words

Year:
1999
Language:
english
File:
PDF, 1.06 MB
english, 1999
5

On Abelian squares and substitutions

Year:
1999
Language:
english
File:
PDF, 1.23 MB
english, 1999
7

The exact number of squares in Fibonacci words

Year:
1999
Language:
english
File:
PDF, 706 KB
english, 1999
8

Maximal bifix codes

Year:
1999
Language:
english
File:
PDF, 1.01 MB
english, 1999
10

Partial words and a theorem of Fine and Wilf

Year:
1999
Language:
english
File:
PDF, 413 KB
english, 1999
11

Transcendence of formal power series with rational coefficients

Year:
1999
Language:
english
File:
PDF, 1.35 MB
english, 1999
12

On repetition-free binary words of minimal density

Year:
1999
Language:
english
File:
PDF, 1.08 MB
english, 1999
13

Complexity for finite factors of infinite sequences

Year:
1999
Language:
english
File:
PDF, 1.22 MB
english, 1999
14

Constant-space string-matching in sublinear average time

Year:
1999
Language:
english
File:
PDF, 462 KB
english, 1999
15

Quasiperiodicity and string covering

Year:
1999
Language:
english
File:
PDF, 779 KB
english, 1999
16

Editorial Board

Year:
1999
File:
PDF, 261 KB
1999