RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 47 (2013) no. 2

Table of contents

Signed Chip Firing Games and symmetric Sandpile Models on the cycles

Cori, Robert; Duong Phan, Thi Ha; Huong Tran, Thi Thu

p. 133-146

On the hardness of game equivalence under local isomorphism

Gabarró, Joaquim; García, Alina; Serna, Maria

p. 147-169

A tight bound for exhaustive key search attacks against Message Authentication Codes

de SÁ, Vinícius G. P.; Boccardo, Davidson R.; Rust, Luiz Fernando; Machado, Raphael C. S.

p. 171-180

Cutwidth of iterated caterpillars

Lin, Lan; Lin, Yixun

p. 181-193

A note on constructing infinite binary words with polynomial subword complexity

Blanchet-Sadri, Francine; Chen, Bob; Munteanu, Sinziana

p. 195-199

Decidability of the HD0L ultimate periodicity problem

Durand, Fabien

p. 201-214