RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

RAIRO: ITA is a section of RAIRO, Revue d'Automatique, d'Informatique et de Recherche Opérationnelle. RAIRO is an international journal devoted to high-level pure and applied research on the use of scientific methods and information processing in business and industry. Read more

Free Access

Editorial

Foreword to the special issue dedicated to the sixteenth “Journées Montoises d’Informatique Théorique”

Émilie Charlier, Julien Leroy and Michel Rigo

RAIRO-Theor. Inf. Appl., 51 4 (2017) 167

Published online: 13 February 2018

DOI: https://doi.org/10.1051/ita/2018001
- PDF (130.9 KB)
On avoidability of formulas with reversal

James D. Currie, Lucas Mol and Narad Rampersad

RAIRO-Theor. Inf. Appl., 51 4 (2017) 181-189

Published online: 13 February 2018

DOI: https://doi.org/10.1051/ita/2017013
- PDF (331.2 KB)
- References
A uniform cube-free morphism is k-power-free for all integers k ≥ 4

Francis Wlazinski

RAIRO-Theor. Inf. Appl., 51 4 (2017) 205-216

Published online: 13 February 2018

DOI: https://doi.org/10.1051/ita/2017015
- PDF (465.4 KB)
- References
Translation of a Digital Line into another according to various Digitization Processes

Jean-Pierre Borel

RAIRO-Theor. Inf. Appl., 51 4 (2017) 169-180

Published online: 31 January 2018

DOI: https://doi.org/10.1051/ita/2017016
- PDF (1.692 MB)
- References
Cellular automata and powers of p∕q

Jarkko Kari and Johan Kopra

RAIRO-Theor. Inf. Appl., 51 4 (2017) 191-204

Published online: 31 January 2018

DOI: https://doi.org/10.1051/ita/2017014
- PDF (574.9 KB)
- References
Bipartite binomial heaps

Amr Elmasry, Claus Jensen and Jyrki Katajainen

RAIRO-Theor. Inf. Appl., 51 3 (2017) 121-133

Published online: 12 December 2017

DOI: https://doi.org/10.1051/ita/2017010
- PDF (278.8 KB)
- References

Most read articles

2	Free Access Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire Jean-Luc Rémy RAIRO. Inform. théor., 19 2 (1985) 179-195 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1985190201791 PDF (1.00 MB) References
2	Translation of a Digital Line into another according to various Digitization Processes Jean-Pierre Borel RAIRO-Theor. Inf. Appl., 51 4 (2017) 169-180 Published online: 31 January 2018 DOI: https://doi.org/10.1051/ita/2017016 PDF (1.692 MB) References
2	Free Access Tours de Hanoï et automates J.-P. Allouche and F. Dress RAIRO-Theor. Inf. Appl., 24 1 (1990) 1-15 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1990240100011 PDF (1.03 MB) References
2	Free Access On some context free languages that are not deterministic ETOL languages A. Ehrenfeucht and G. Rozenberg RAIRO. Inform. théor., 11 4 (1977) 273-291 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1977110402731 PDF (1.42 MB) References
1	Free Access Repetitions in the Fibonacci infinite word F. Mignosi and G. Pirillo RAIRO-Theor. Inf. Appl., 26 3 (1992) 199-204 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1992260301991 PDF (459 KB) References

77	Free Access The complexity of the travelling repairman problem Foto Afrati, Stavros Cosmadakis, Christos H. Papadimitriou, George Papageorgiou and Nadia Papakostantinou RAIRO-Theor. Inf. Appl., 20 1 (1986) 79-87 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1986200100791 PDF (670 KB) References
55	Free Access A property of biprefix codes Martine Leonard RAIRO-Theor. Inf. Appl., 22 3 (1988) 311-318 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1988220303111 PDF (544 KB) References
24	Free Access On the Horton-Strahler number for random tries L. Devroye and P. Kruszewski RAIRO-Theor. Inf. Appl., 30 5 (1996) 443-456 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1996300504431 PDF (950 KB) References
23	Free Access Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire Jean-Luc Rémy RAIRO. Inform. théor., 19 2 (1985) 179-195 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1985190201791 PDF (1.00 MB) References
19	Bipartite binomial heaps Amr Elmasry, Claus Jensen and Jyrki Katajainen RAIRO-Theor. Inf. Appl., 51 3 (2017) 121-133 Published online: 12 December 2017 DOI: https://doi.org/10.1051/ita/2017010 PDF (278.8 KB) References

RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

Foreword to the special issue dedicated to the sixteenth “Journées Montoises d’Informatique Théorique”

On avoidability of formulas with reversal

A uniform cube-free morphism is k-power-free for all integers k ≥ 4

Translation of a Digital Line into another according to various Digitization Processes

Cellular automata and powers of p∕q

Bipartite binomial heaps

Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire

Translation of a Digital Line into another according to various Digitization Processes

Tours de Hanoï et automates

On some context free languages that are not deterministic ETOL languages

Repetitions in the Fibonacci infinite word

Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire

Foreword to the special issue dedicated to the sixteenth “Journées Montoises d’Informatique Théorique”

On some context free languages that are not deterministic ETOL languages

The complexity of the travelling repairman problem

On some properties of the syntactic semigroup of a very pure subsemigroup

The complexity of the travelling repairman problem

A property of biprefix codes

On the Horton-Strahler number for random tries

Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire

Bipartite binomial heaps

News