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 determinacy strength of pushdown ω-languages

Wenjuan Li and Kazuyuki Tanaka

RAIRO-Theor. Inf. Appl., 51 1 (2017) 29-50

Published online: 07 July 2017

DOI: https://doi.org/10.1051/ita/2017006
- PDF (817.6 KB)
- References
Relationships between vertex attack tolerance and other vulnerability parameters

Vecdi Aytaç and Tufan Turaci

RAIRO-Theor. Inf. Appl., 51 1 (2017) 17-27

Published online: 13 April 2017

DOI: https://doi.org/10.1051/ita/2017005
- PDF (212.3 KB)
- References
Interval exchanges, admissibility and branching Rauzy induction

Francesco Dolce and Dominique Perrin

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

Published online: 12 April 2017

DOI: https://doi.org/10.1051/ita/2017004
- PDF (687.3 KB)
- References
Analysis of digital search trees incorporated with paging

Mehri Javanian and Mohammad Q. Vahidi-asl

RAIRO-Theor. Inf. Appl., 51 1 (2017) 7-15

Published online: 05 April 2017

DOI: https://doi.org/10.1051/ita/2017002
- PDF (179.8 KB)
- References
Rational series with high image complexity

Juha Honkala

RAIRO-Theor. Inf. Appl., 51 1 (2017) 1-6

Published online: 27 February 2017

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

DOI: https://doi.org/10.1051/ita/2017003
- PDF (37.53 KB)

Most read articles

4	Free Access On-line finite automata for addition in some numeration systems Christiane Frougny RAIRO-Theor. Inf. Appl., 33 1 (1999) 79-101 Published online: 15 August 2002 DOI: https://doi.org/10.1051/ita:1999107 PDF (486.7 KB) References
4	Free Access Foreword Preface Igor Walukiewicz RAIRO-Theor. Inf. Appl., 39 3 (2005) 421-422 Published online: 15 July 2005 DOI: https://doi.org/10.1051/ita:2005031 PDF (32.17 KB)
3	Free Access Foreword Preface J. Berstel, T. Harju and J. Karhumäki RAIRO-Theor. Inf. Appl., 42 4 (2008) 657 Published online: 04 January 2008 DOI: https://doi.org/10.1051/ita:2008001 PDF (35.56 KB)
3	Free Access Editorial Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011) Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto and Beatrice Palano RAIRO-Theor. Inf. Appl., 46 4 (2012) 459-460 Published online: 30 July 2012 DOI: https://doi.org/10.1051/ita/2012022 PDF (44.19 KB)
3	Free Access Strongly locally testable semigroups with commuting idempotents and related languages Carla Selmi RAIRO-Theor. Inf. Appl., 33 1 (1999) 47-57 Published online: 15 August 2002 DOI: https://doi.org/10.1051/ita:1999105 PDF (320.7 KB) References

RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

The determinacy strength of pushdown ω-languages

Relationships between vertex attack tolerance and other vulnerability parameters

Interval exchanges, admissibility and branching Rauzy induction

Analysis of digital search trees incorporated with paging

Rational series with high image complexity

Preface: Non-Classical Models of Automata and Applications VII

On-line finite automata for addition in some numeration systems

Preface

Preface

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)

Strongly locally testable semigroups with commuting idempotents and related languages

Learning deterministic regular grammars from stochastic samples in polynomial time

On-line finite automata for addition in some numeration systems

Strongly locally testable semigroups with commuting idempotents and related languages

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)

Preface: Non-Classical Models of Automata and Applications VII

Preface: Non-Classical Models of Automata and Applications VII

Learning deterministic regular grammars from stochastic samples in polynomial time

On-line finite automata for addition in some numeration systems

Preface

Strongly locally testable semigroups with commuting idempotents and related languages

News

10	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 On-line finite automata for addition in some numeration systems Christiane Frougny RAIRO-Theor. Inf. Appl., 33 1 (1999) 79-101 Published online: 15 August 2002 DOI: https://doi.org/10.1051/ita:1999107 PDF (486.7 KB) References
8	Free Access Strongly locally testable semigroups with commuting idempotents and related languages Carla Selmi RAIRO-Theor. Inf. Appl., 33 1 (1999) 47-57 Published online: 15 August 2002 DOI: https://doi.org/10.1051/ita:1999105 PDF (320.7 KB) References
7	Free Access Editorial Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011) Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto and Beatrice Palano RAIRO-Theor. Inf. Appl., 46 4 (2012) 459-460 Published online: 30 July 2012 DOI: https://doi.org/10.1051/ita/2012022 PDF (44.19 KB)
7	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 DOI: https://doi.org/10.1051/ita/2017003 PDF (37.53 KB)