---

Theoretical Informatics and Applications

Vol. 39 No. 4 (October-December 2005)

• The entropy of Lukasiewicz-languages     p. 621
  Ludwig Staiger
  Abstract | PDF file (252 KB) | References



• Languages of finite words occurring infinitely many times in an infinite word     p. 641
  Klaus Thomsen
  Abstract | PDF file (189 KB) | References



• Note sur les relations entre les racines d'un polynôme réductible (Text in French)     p. 651
  Sébastien Orange, Guenaël Renault and Annick Valibouze
  Abstract | PDF file (154 KB) | References



• Equality sets for recursively enumerable languages     p. 661
  Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom and Michel Latteux
  Abstract | PDF file (206 KB) | References



• On maximal QROBDD's of Boolean functions     p. 677
  Jean-Francis Michon, Jean-Baptiste Yunès and Pierre Valarcher
  Abstract | PDF file (164 KB) | References



• One-way communication complexity of symmetric Boolean functions     p. 687
  Jan Arpe, Andreas Jakoby and Maciej Liskiewicz
  Abstract | PDF file (272 KB) | References

---

© EDP Sciences 2005