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 - Informatique Théorique et Applications
  • Volume 34 (2000)
  • no. 2
  • Next

Volume 34 (2000) no. 2

Table of contents


Perfect matching in general vs. cubic graphs : a note on the planar and bipartite cases
Bampis, E.;   Giannakos, A.; Karzanov, A.; Manoussakis, Y.;   Milis, I.  
p. 87-97

Iteration of rational transductions
Terlutte, Alain;   Simplot, David  
p. 99-129

Three generators for minimal writing-space computations
Burckel, Serge; Morillon, Marianne
p. 131-138

Asynchronous sliding block maps
Béal, Marie-Pierre;   Carton, Olivier  
p. 139-156

On the decidability of the equivalence problem for monadic recursive programs
Zakharov, Vladimir A.
p. 157-171
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of