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 inclusion structure of partially lossy queue monoids and their trace submonoids

Chris Köcher, Dietrich Kuske and Olena Prianychnykova

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

Published online: 18 July 2018

DOI: https://doi.org/10.1051/ita/2018003
- PDF (543.3 KB)
- References
Minimum parametric flow in time-dependent dynamic networks

Mircea Parpalea, Nicoleta Avesalon and Eleonor Ciurea

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

Published online: 11 July 2018

DOI: https://doi.org/10.1051/ita/2018002
- PDF (509.4 KB)
- References
State hyperstructures of tree automata based on lattice-valued logic

Maryam Ghorani

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

Published online: 11 July 2018

DOI: https://doi.org/10.1051/ita/2018004
- PDF (471.9 KB)
- References
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., Publication ahead of print

Published online: 11 July 2018

DOI: https://doi.org/10.1051/ita/2018005
- PDF (698.5 KB)
- References
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

Most read articles

34	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
4	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
4	Free Access Quelques problèmes ouverts en théorie des langages algébriques J. M. Autebert, J. Beauquier, L. Boasson and M. Nivat RAIRO. Inform. théor., 13 4 (1979) 363-378 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1979130403631 PDF (1.56 MB) References
4	Free Access Sur les termes nuls d'une suite récurrente cubique P. A. Picon R.A.I.R.O. Informatique théorique, 8 R3 (1974) 47-61 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/197408R300471 PDF (1.13 MB) References
3	Free Access Une généralisation de la théorie des types en $\lambda $-calcul Patrick Sallé RAIRO. Inform. théor., 14 2 (1980) 143-167 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1980140201431 PDF (2.07 MB) References

290	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
57	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
54	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
33	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
23	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)

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

Minimum parametric flow in time-dependent dynamic networks

State hyperstructures of tree automata based on lattice-valued logic

On Describing the Regular Closure of the Linear Languages with Graph-Controlled Insertion-Deletion Systems

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

On avoidability of formulas with reversal

Learning deterministic regular grammars from stochastic samples in polynomial time

A property of biprefix codes

Quelques problèmes ouverts en théorie des langages algébriques

Sur les termes nuls d'une suite récurrente cubique

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

Learning deterministic regular grammars from stochastic samples in polynomial time

A property of biprefix codes

Analysis of quickselect : an algorithm for order statistics

Sur les termes nuls d'une suite récurrente cubique

Une heuristique pour le calcul de l'indice de transitivité d'un tournoi

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

A property of biprefix codes

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

News