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 39 (2005)
  • no. 4
  • Next

Volume 39 (2005) no. 4

Table of contents


The entropy of Łukasiewicz-languages
Staiger, Ludwig
p. 621-639

Languages of finite words occurring infinitely many times in an infinite word
Thomsen, Klaus
p. 641-650

Note sur les relations entre les racines d'un polynôme réductible
Orange, Sébastien;   Renault, Guenaël;   Valibouze, Annick  
p. 651-659

Equality sets for recursively enumerable languages
Halava, Vesa; Harju, Tero;   Hoogeboom, Hendrik Jan;   Latteux, Michel  
p. 661-675

On maximal QROBDD's of boolean functions
Michon, Jean-Francis;   Yunès, Jean-Baptiste;   Valarcher, Pierre  
p. 677-686

One-way communication complexity of symmetric boolean functions
Arpe, Jan; Jakoby, Andreas; Liśkiewicz, Maciej
p. 687-706
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of