RAIRO - Theoretical Informatics and Applications

Free Access

Foreword

Foreword p. 1

V. Bruyère and M. Rigo

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010001

• PDF (37.30 KB)

Morphisms fixing words associated with exchange of three intervals p. 3

Petr Ambrož, Zuzana Masáková and Edita Pelantová

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010002

• PDF (214.8 KB)
• References

Radix enumeration of rational languages p. 19

Pierre-Yves Angrand and Jacques Sakarovitch

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010003

• PDF (956.0 KB)
• References

On the computation of covert channel capacity p. 37

Eugene Asarin and Cătălin Dima

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010004

• PDF (274.3 KB)
• References

How to build billiard words using decimations p. 59

Jean-Pierre Borel

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010005

• PDF (486.9 KB)
• References

Formal language properties of hybrid systems with strong resets p. 79

Thomas Brihaye, Véronique Bruyère and Elaine Render

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010006

• PDF (768.0 KB)
• References

Infinite words containing squares at every position p. 113

James Currie and Narad Rampersad

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010007

• PDF (184.7 KB)
• References

On the number of squares in partial words p. 125

Vesa Halava, Tero Harju and Tomi Kärki

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010008

• PDF (213.3 KB)
• References

The critical exponent of the Arshon words p. 139

Dalia Krieger

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010009

• PDF (191.9 KB)
• References

Binary words avoiding the pattern AABBCABBA p. 151

Pascal Ochem

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010010

• PDF (151.4 KB)
• References

Standard factors of Sturmian words p. 159

Gwénaël Richomme, Kalle Saari and Luca Q. Zamboni

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010011

• PDF (217.0 KB)
• References

On the growth rates of complexity of threshold languages p. 175

Arseny M. Shur and Irina A. Gorbunova

Published online: 11 February 2010

DOI: https://doi.org/10.1051/ita/2010012

• PDF (303.1 KB)
• References