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
  • RAIRO. Theoretical Informatics and Applications
  • Volume 31 (1997)
  • no. 3

Volume 31 (1997) no. 3

Table of contents


Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
Hibti, M.;   Legeard, B.;   Lombardi, H.  
p. 205-236

On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups
Blanchet-Sadri, F.
p. 237-250

Skip trees, an alternative data structure to skip lists in a concurrent approach
Messeguer, Xavier
p. 251-269

Decimations and sturmian words
Justin, Jacques; Pirillo, Giuseppe  
p. 271-290

Polynomial size test sets for commutative languages
Hakala, Ismo; Kortelainen, Juha
p. 291-304
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of