Tome 21 (1987) no. 2

Sommaire

Notes on finite asynchronous automata
p. 99-135
Sur les centres de DOL-langages
p. 137-145
Sequential mappings of ω-languages
p. 147-173
On the complexity of computable real sequences
p. 175-180
Complexité de problèmes liés aux graphes sans circuit
p. 181-197
An almost naive algorithm for finding relative neighbourhood graphs in L p metrics
p. 199-215