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 33 (1999)
  • no. 3
  • Next

Volume 33 (1999) no. 3

Table of contents


Unavoidable set : extension and reduction
Phan Trung Huy; Nguyen Huong Lam
p. 213-225

Normalisation of the theory 𝐓 of Cartesian closed categories and conservativity of extensions mathbfT[x] of mathbfT
Preller, Anne; Duroux, P.
p. 227-257

On existentially first-order definable languages and their relation to NP
Borchert, Bernd; Kuske, Dietrich;   Stephan, Frank
p. 259-269

There is no complete axiom system for shuffle expressions
Szepietowski, A.
p. 271-277

Non-looping string rewriting
Geser, Alfons; Zantema, Hans
p. 279-301

Lower space bounds for accepting shuffle languages
Szepietowski, Andrzej  
p. 303-307
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of