Tome 30 (1996) no. 6

Sommaire

On codes having no finite completion
p. 483-493
Les automates circulaires biaisés vérifient la conjecture de Černý
p. 495-505
Digital search trees with keys of variable length
p. 507-520
Efficient string matching on packed texts
p. 521-544
On the average minimal prefix-length of the generalized semi-Dycklanguage
p. 545-561