Tome 20 (1986) no. 1

Sommaire

Éditorial
ITA
p. 3-4
Über die implementierung redundanzfreier Codes zur datenverschlüsselung
p. 5-29
The topological structure of adherences of regular languages
p. 31-41
Decidability of periodicity for infinite words
p. 43-46
On the periodicity of morphisms on free monoids
p. 47-54
Single-tape reset machines
p. 55-77
The complexity of the travelling repairman problem
p. 79-87
Each regular code is included in a maximal regular code
p. 89-96