RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 40 (2006) no. 3

Table of contents

Foreword

Richomme, Gwénaël

p. 405

Well quasi-orders, unavoidable sets, and derivation systems

D'Alessandro, Flavio; Varricchio, Stefano

p. 407-426

A generator of morphisms for infinite words

Ochem, Pascal

p. 427-441

On possible growths of arithmetical complexity

Frid, Anna E.

p. 443-458

Transcendence of numbers with an expansion in a subclass of complexity 2n + 1

Kärki, Tomi

p. 459-471

Squares and overlaps in the Thue-Morse sequence and some variants

Brown, Shandy; Rampersad, Narad; Shallit, Jeffrey; Vasiga, Troy

p. 473-484

Deterministic blow-ups of minimal NFA's

Jirásková, Galina

p. 485-499

Note on the complexity of Las Vegas automata problems

Jirásková, Galina

p. 501-510

A little more about morphic sturmian words

Fagnot, Isabelle

p. 511-518