RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)
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.
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)
is being published under Subscribe to Open. All articles are published in open access free of charge under a
CC-BY 4.0 license
More information and FAQs are available
here
. To discuss or join the programme, please
Latest articles
Most read articles
Most cited articles
Open Access
On describing trees and quasi-trees from their leaves
Bruno Courcelle
RAIRO-Theor. Inf. Appl., 60 (2026) 13
Published online: 03 April 2026
Diophantine Analysis and Related Topics (DART2025Z)
Open Access
Diophantine approximation with two squares and three biquadrates of primes
Yu Fu
Liqun Hu
Siqi Liu
and
Li Yang
RAIRO-Theor. Inf. Appl., 60 (2026) 12
Published online: 31 March 2026
Diophantine Analysis and Related Topics (DART2025Z)
Open Access
Fibonacci Determinants. III
Takao Komatsu
and
Emrah Kiliç
RAIRO-Theor. Inf. Appl., 60 (2026) 8
Published online: 17 March 2026
Diophantine Analysis and Related Topics (DART2025Z)
Open Access
On the Numbers of Ramanujan
Mehmet Cenkci
and
Takao Komatsu
RAIRO-Theor. Inf. Appl., 60 (2026) 9
Published online: 17 March 2026
Open Access
On some infinite matrices of binomial type and their generating functions
Murat Erdoğan
Cenap Duyar
and
Nilay Değirmen
RAIRO-Theor. Inf. Appl., 60 (2026) 10
Published online: 17 March 2026
Open Access
General position number of hierarchical scale-free graphs
Naoki Matsumoto
RAIRO-Theor. Inf. Appl., 60 (2026) 11
Published online: 17 March 2026
Most read articles
7 days
30 days
90 days
Free Access
Upper bound for palindromic and factor complexity of rich words
Josef Rukavicka
RAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
Free Access
On $z$-submonoids and $z$-codes
M. Madonia
S. Salemi
and
T. Sportelli
RAIRO-Theor. Inf. Appl., 25 4 (1991) 305-322
Published online: 01 February 2017
Generation, enumeration and tiling
Open Access
HBS and star tilings: State of the art and novel observations
Carole Porrier
RAIRO-Theor. Inf. Appl., 59 (2025) 10
Published online: 02 October 2025
Open Access
Properties of a ternary infinite word
James Currie
Pascal Ochem
Narad Rampersad
and
Jeffrey Shallit
RAIRO-Theor. Inf. Appl., 57 (2023) 1
Published online: 18 January 2023
Free Access
Une remarque sur les systèmes complets d'identités rationnelles
Maurice Boffa
RAIRO-Theor. Inf. Appl., 24 4 (1990) 419-423
Published online: 01 February 2017
Free Access
Upper bound for palindromic and factor complexity of rich words
Josef Rukavicka
RAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)
Open Access
Synchronizing series-parallel deterministic finite automata with loops and related problems
Jens Bruchertseifer
and
Henning Fernau
RAIRO-Theor. Inf. Appl., 55 (2021) 7
Published online: 22 July 2021
Generation, enumeration and tiling
Open Access
HBS and star tilings: State of the art and novel observations
Carole Porrier
RAIRO-Theor. Inf. Appl., 59 (2025) 10
Published online: 02 October 2025
Generation, enumeration and tiling
Open Access
Efficient counting of
-convex polyominoes
Anthony J. Guttmann
and
Paolo Massazza
RAIRO-Theor. Inf. Appl., 59 (2025) 11
Published online: 15 October 2025
Open Access
On some infinite matrices of binomial type and their generating functions
Murat Erdoğan
Cenap Duyar
and
Nilay Değirmen
RAIRO-Theor. Inf. Appl., 60 (2026) 10
Published online: 17 March 2026
Free Access
Upper bound for palindromic and factor complexity of rich words
Josef Rukavicka
RAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
Free Access
One-rule semi-Thue systems with loops of length one, two or three
Winfried Kurth
RAIRO-Theor. Inf. Appl., 30 5 (1996) 415-429
Published online: 01 February 2017
Generation, enumeration and tiling
Open Access
HBS and star tilings: State of the art and novel observations
Carole Porrier
RAIRO-Theor. Inf. Appl., 59 (2025) 10
Published online: 02 October 2025
11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)
Open Access
Synchronizing series-parallel deterministic finite automata with loops and related problems
Jens Bruchertseifer
and
Henning Fernau
RAIRO-Theor. Inf. Appl., 55 (2021) 7
Published online: 22 July 2021
Generation, enumeration and tiling
Open Access
Efficient counting of
-convex polyominoes
Anthony J. Guttmann
and
Paolo Massazza
RAIRO-Theor. Inf. Appl., 59 (2025) 11
Published online: 15 October 2025
Recent articles (published in the past 5 years)
12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022)
Open Access
Non-returning deterministic and nondeterministic finite automata with translucent letters
František Mráz
and
Friedrich Otto
RAIRO-Theor. Inf. Appl., 57 (2023) 8
Published online: 18 October 2023
Randomness and Combinatorics - Edited by Luca Ferrari & Paolo Massazza
Open Access
Human-verifiable proofs in the theory of word-representable graphs
Sergey Kitaev
and
Haoran Sun
RAIRO-Theor. Inf. Appl., 58 (2024) 9
Published online: 26 March 2024
11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)
Open Access
On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers
Benedek Nagy
and
Zita Kovács
RAIRO-Theor. Inf. Appl., 55 (2021) 5
Published online: 22 July 2021
Generation, enumeration and tiling
Open Access
Explicit values of a
-multiple zeta-star function at roots of unity
Takao Komatsu
RAIRO-Theor. Inf. Appl., 59 (2025) 5
Published online: 19 August 2025
12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022)
Open Access
On the accepting state complexity of operations on permutation automata
Christian Rauch
and
Markus Holzer
RAIRO-Theor. Inf. Appl., 57 (2023) 9
Published online: 07 November 2023
Submit your paper
Instructions for authors
Recommend this journal
Subscribe to the journal
2024 Impact Factor*:
0.5
2024 5-Year Impact Factor*:
0.5
*JCR, Clarivate Analytics © 2025
Sign up for email alerts
Editor-in-Chief: Enrico FORMENTI
eISSN: 2804-7346
Topical Issue on:
Diophantine Analysis and Related Topics in Zhengzhou (DART2025Z)
Submission deadline:
31 May 2026
News
Road to Open: Despite Challenges, Mathematics Journals Remain Open Access through Subscribe to Open in 2025
Open Access and Transparency: EDP Sciences Releases 2024 Transparency Report for Mathematics Journals
Road to Open: Library and institutional support sustains open access in Mathematics journals through Subscribe to Open in 2024
More News
Open Math through S2O partnership
More information
S2O leaflet