Table of contents
Theoretical Informatics and Applications
Vol. 34 No. 5 (September/October 2000)
- 331
- A Lower Bound For Reversible Automata
Pierre-Cyrille Héam
Abstract | References | PDF file (161 Kb)
- 343
- Return words in Sturmian and episturmian words
J. Justin and L. Vuillon
Abstract | References | PDF file (187 Kb)
- 357
- A space lower bound for acceptance by one-way
-alternating machines
V. Geffert and N. Popély
Abstract | References | PDF file (231 Kb)
- 373
- On a paper by Castelli, Mignosi, Restivo
J. Justin
Abstract | References | PDF file (112 Kb)
- 379
- Local transition functions of quantum Turing machines
M. Ozawa and H. Nishimura
Abstract | References | PDF file (231 Kb)
- 403
- Complexité et automates cellulaires linéaires
V. Berthé
Abstract | References | PDF file (220 Kb)
Copyright EDP Sciences



Table of contents 