Home
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
Browse issues
  • All
  • Author
  • Title
  • References
  • Full text
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • Previous
  • RAIRO. Theoretical Informatics and Applications
  • Volume 34 (2000)
  • no. 5
  • Next

Volume 34 (2000) no. 5

Table of contents


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
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of