Tome 47 (2013) no. 2

Sommaire

Signed Chip Firing Games and symmetric Sandpile Models on the cycles
p. 133-146
On the hardness of game equivalence under local isomorphism
p. 147-169
A tight bound for exhaustive key search attacks against Message Authentication Codes
p. 171-180
Cutwidth of iterated caterpillars
p. 181-193
A note on constructing infinite binary words with polynomial subword complexity
p. 195-199
Decidability of the HD0L ultimate periodicity problem
p. 201-214