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

26	Free Access Learning deterministic regular grammars from stochastic samples in polynomial time Rafael C. Carrasco and Jose Oncina RAIRO-Theor. Inf. Appl., 33 1 (1999) 1-19 Published online: 15 August 2002 DOI: https://doi.org/10.1051/ita:1999102 PDF (395.2 KB) References
8	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
3	Free Access The difference and truth-table hierarchies for NP Johannes Köbler, Uwe Schöning and Klaus W. Wagner RAIRO-Theor. Inf. Appl., 21 4 (1987) 419-435 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1987210404191 PDF (1.25 MB) References
3	Free Access Foreword Foreword Vasco Brattka, Christiane Frougny and Norbert Mueller RAIRO-Theor. Inf. Appl., 41 1 (2007) 1-2 Published online: 24 April 2007 DOI: https://doi.org/10.1051/ita:2007001 PDF (37.59 KB)
3	Free Access The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues B. Courcelle RAIRO-Theor. Inf. Appl., 26 3 (1992) 257-286 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1992260302571 PDF (2.61 MB) 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

Learning deterministic regular grammars from stochastic samples in polynomial time

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

The difference and truth-table hierarchies for NP

Foreword

The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

Learning deterministic regular grammars from stochastic samples in polynomial time

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

Analysis of quickselect : an algorithm for order statistics

The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

Méthodes d'optimisation pour un problème de théorie des nombres

Learning deterministic regular grammars from stochastic samples in polynomial time

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

Analysis of quickselect : an algorithm for order statistics

Modèles non déterministes de types abstraits

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

News

61	Free Access Learning deterministic regular grammars from stochastic samples in polynomial time Rafael C. Carrasco and Jose Oncina RAIRO-Theor. Inf. Appl., 33 1 (1999) 1-19 Published online: 15 August 2002 DOI: https://doi.org/10.1051/ita:1999102 PDF (395.2 KB) References
33	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
18	Free Access Analysis of quickselect : an algorithm for order statistics Hosam M. Mahmoud, Reza Modarres and Robert T. Smythe RAIRO-Theor. Inf. Appl., 29 4 (1995) 255-276 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1995290402551 PDF (1.36 MB) References
13	Free Access The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues B. Courcelle RAIRO-Theor. Inf. Appl., 26 3 (1992) 257-286 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1992260302571 PDF (2.61 MB) References
10	Free Access Méthodes d'optimisation pour un problème de théorie des nombres G. Robin RAIRO. Inform. théor., 17 3 (1983) 239-247 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1983170302391 PDF (619 KB) References