RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 30 (1996) no. 6

Table of contents

On codes having no finite completion

Nguyen Huong Lam

p. 483-493

Les automates circulaires biaisés vérifient la conjecture de Černý

Dubuc, L.

p. 495-505

Digital search trees with keys of variable length

Nebel, Markus E.

p. 507-520

Efficient string matching on packed texts

Breslauer, D.; Gasieniec, Leszek

p. 521-544

On the average minimal prefix-length of the generalized semi-Dycklanguage

Kemp, Rainer

p. 545-561