Subscriber Authentication Point

EDPS Account

Volume 30 / No 6 (1996)

Free Access to the whole issue

RAIRO - Theoretical Informatics and Applications

Volume 30 / No 6 (1996)

Export the citation of the selected articles Export
Select all

Free Access

On codes having no finite completion p. 483

Nguyen Huong Lam

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1996300604831

Free Access

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

L. Dubuc

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1996300604951

Free Access

Digital search trees with keys of variable length p. 507

Markus E. Nebel

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1996300605071

Free Access

Efficient string matching on packed texts p. 521

D. Breslauer and Leszek Gasieniec

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1996300605211

Free Access

On the average minimal prefix-length of the generalized semi-Dycklanguage p. 545

Rainer Kemp

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1996300605451