Tome 40 (2006) no. 1

Sommaire

Series which are both max-plus and min-plus rational are unambiguous
p. 1-14
On Christoffel classes
p. 15-27
On a complete set of operations for factorizing codes
p. 29-52
Theories of orders on the set of words
p. 53-74
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
p. 75-91