RAIRO - Theoretical Informatics and Applications

Free Access

Foreword

Foreword p. 405

Gwénaël Richomme

Published online: 18 October 2006

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

• Abstract
• PDF (23.15 KB)

Well quasi-orders, unavoidable sets, and derivation systems p. 407

Flavio D'Alessandro and Stefano Varricchio

Published online: 18 October 2006

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

• Abstract
• PDF (237.6 KB)
• References

A generator of morphisms for infinite words p. 427

Pascal Ochem

Published online: 18 October 2006

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

• Abstract
• PDF (160.2 KB)
• References

On possible growths of arithmetical complexity p. 443

Anna E. Frid

Published online: 18 October 2006

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

• Abstract
• PDF (268.3 KB)
• References

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

Tomi Kärki

Published online: 18 October 2006

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

• Abstract
• PDF (357.6 KB)
• References

Squares and overlaps in the Thue-Morse sequence and some variants p. 473

Shandy Brown, Narad Rampersad, Jeffrey Shallit and Troy Vasiga

Published online: 18 October 2006

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

• Abstract
• PDF (163.8 KB)
• References

Deterministic blow-ups of minimal NFA's p. 485

Galina Jirásková

Published online: 18 October 2006

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

• Abstract
• PDF (222.6 KB)
• References

Note on the complexity of Las Vegas automata problems p. 501

Galina Jirásková

Published online: 18 October 2006

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

• Abstract
• PDF (146.3 KB)
• References

A little more about morphic Sturmian words p. 511

Isabelle Fagnot

Published online: 18 October 2006

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

• Abstract
• PDF (133.9 KB)
• References