---

Theoretical Informatics and Applications

Vol. 40 No. 1 (January-March 2006)

• Series which are both max-plus and min-plus rational are unambiguous     p. 1
  Sylvain Lombardy and Jean Mairesse
  Abstract | PDF file (217 KB) | References



• On Christoffel classes     p. 15
  Jean-Pierre Borel and Christophe Reutenauer
  Abstract | PDF file (220 KB) | References



• On a complete set of operations for factorizing codes     p. 29
  Clelia De Felice
  Abstract | PDF file (300 KB) | References



• Theories of orders on the set of words     p. 53
  Dietrich Kuske
  Abstract | PDF file (277 KB) | References



• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP     p. 75
  Edith Hemaspaandra, Jörg Rothe and Holger Spakowski
  Abstract | PDF file (223 KB) | References

---

© EDP Sciences 2006