RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 21 (1987) no. 2

Table of contents

Notes on finite asynchronous automata

Zielonka, Wieslaw

p. 99-135

Sur les centres de DOL-langages

Terlutte, A.

p. 137-145

Sequential mappings of

ω

Staiger, Ludwig

p. 147-173

On the complexity of computable real sequences

Torán, Jacobo

p. 175-180

Complexité de problèmes liés aux graphes sans circuit

Bordat, J. P.

p. 181-197

An almost naive algorithm for finding relative neighbourhood graphs in

L_{p}

Katajainen, Jyrki; Nevalainen, Olli

p. 199-215