RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 5

Sommaire

A lower bound for reversible automata

Héam, Pierre-Cyrille

p. 331-341

Return words in sturmian and episturmian words

Justin, Jacques ; Vuillon, Laurent

p. 343-356

A space lower bound for acceptance by one-way

Π_{2}

-alternating machines

Geffert, Viliam ; Popély, Norbert

p. 357-372

On a paper by Castelli, Mignosi, Restivo

Justin, Jacques

p. 373-377

Local transition functions of quantum Turing machines

Ozawa, Masanao ; Nishimura, Harumichi

p. 379-402

Complexité et automates cellulaires linéaires

Berthé, Valérie

p. 403-423