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

The complexity of weakly recognizing morphisms

Lukas Fleischer and Manfred Kufleitner

RAIRO-Theor. Inf. Appl., Publication ahead of print

Published online: 15 November 2018
The inclusion structure of partially lossy queue monoids and their trace submonoids

Chris Köcher, Dietrich Kuske and Olena Prianychnykova

RAIRO-Theor. Inf. Appl., 52 1 (2018) 55-86

Published online: 18 July 2018
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman

RAIRO-Theor. Inf. Appl., 52 1 (2018) 1-21

Published online: 11 July 2018
State hyperstructures of tree automata based on lattice-valued logic

Maryam Ghorani

RAIRO-Theor. Inf. Appl., 52 1 (2018) 23-42

Published online: 11 July 2018
Minimum parametric flow in time-dependent dynamic networks

Mircea Parpalea, Nicoleta Avesalon and Eleonor Ciurea

RAIRO-Theor. Inf. Appl., 52 1 (2018) 43-53

Published online: 11 July 2018
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

Most read articles

4	Free Access Algorithme de Bareiss, algorithme des sous-résultants Lionel Ducos RAIRO-Theor. Inf. Appl., 30 4 (1996) 319-347 Published online: 01 February 2017
2	Free Access Editorial Preface: Non-Classical Models of Automata and Applications VII Markus Holzer, Nelma Moreira and Rogério Reis RAIRO-Theor. Inf. Appl., 50 4 (2016) 273-274 Published online: 01 February 2017
2	From indexed grammars to generating functions Jared Adams, Eric Freden and Marni Mishna RAIRO-Theor. Inf. Appl., 47 4 (2013) 325-350 Published online: 07 October 2013
2	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
2	Free Access Une généralisation de la théorie des types en $\lambda $-calcul (II) Patrick Sallé RAIRO. Inform. théor., 14 3 (1980) 301-314 Published online: 01 February 2017

RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

The complexity of weakly recognizing morphisms

The inclusion structure of partially lossy queue monoids and their trace submonoids

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

State hyperstructures of tree automata based on lattice-valued logic

Minimum parametric flow in time-dependent dynamic networks

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

Algorithme de Bareiss, algorithme des sous-résultants

Preface: Non-Classical Models of Automata and Applications VII

From indexed grammars to generating functions

Analysis of quickselect : an algorithm for order statistics

Une généralisation de la théorie des types en $\lambda $-calcul (II)

Analysis of quickselect : an algorithm for order statistics

The difference and truth-table hierarchies for NP

Algorithme de Bareiss, algorithme des sous-résultants

Decimations and sturmian words

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

Learning deterministic regular grammars from stochastic samples in polynomial time

Analysis of quickselect : an algorithm for order statistics

On sets bounded truth-table reducible to $P$-selective sets

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

Non recursive functions have transcendental generating series

News

32	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
11	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
10	Free Access Algorithme de Bareiss, algorithme des sous-résultants Lionel Ducos RAIRO-Theor. Inf. Appl., 30 4 (1996) 319-347 Published online: 01 February 2017
7	Free Access Decimations and sturmian words Jacques Justin and Giuseppe Pirillo RAIRO-Theor. Inf. Appl., 31 3 (1997) 271-290 Published online: 01 February 2017
7	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

80	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
80	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
55	Free Access On sets bounded truth-table reducible to $P$-selective sets Thomas Thierauf, Seinosuke Toda and Osamu Watanabe RAIRO-Theor. Inf. Appl., 30 2 (1996) 135-154 Published online: 01 February 2017
55	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
55	Free Access Non recursive functions have transcendental generating series Felipe Cucker and Joaquim Gabarró RAIRO-Theor. Inf. Appl., 23 4 (1989) 445-448 Published online: 01 February 2017