Open Access
On describing trees and quasi-trees from their leaves
RAIRO-Theor. Inf. Appl., 60 (2026) 13
Published online: 03 April 2026
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
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 contact us.
More information and FAQs are available here. To discuss or join the programme, please contact us.
-
-
Open Access
Diophantine approximation with two squares and three biquadrates of primes
RAIRO-Theor. Inf. Appl., 60 (2026) 12Published online: 31 March 2026 -
Open Access
Fibonacci Determinants. III
RAIRO-Theor. Inf. Appl., 60 (2026) 8Published online: 17 March 2026 -
Open Access
On the Numbers of Ramanujan
RAIRO-Theor. Inf. Appl., 60 (2026) 9Published online: 17 March 2026 -
Open Access
On some infinite matrices of binomial type and their generating functions
RAIRO-Theor. Inf. Appl., 60 (2026) 10Published online: 17 March 2026 -
Open Access
General position number of hierarchical scale-free graphs
RAIRO-Theor. Inf. Appl., 60 (2026) 11Published online: 17 March 2026
|
Free Access
Upper bound for palindromic and factor complexity of rich wordsRAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
|
|
Open Access
Synchronizing series-parallel deterministic finite automata with loops and related problemsRAIRO-Theor. Inf. Appl., 55 (2021) 7
Published online: 22 July 2021
|
|
Open Access
Diophantine approximation with two squares and three biquadrates of primesRAIRO-Theor. Inf. Appl., 60 (2026) 12
Published online: 31 March 2026
|
|
Free Access
Decomposing a $k$-valued transducer into $k$ unambiguous onesRAIRO-Theor. Inf. Appl., 30 5 (1996) 379-413
Published online: 01 February 2017
|
|
Free Access
The complexity of systolic dissemination of information in interconnection networksRAIRO-Theor. Inf. Appl., 28 3-4 (1994) 303-342
Published online: 03 February 2017
|
Recent articles (published in the past 5 years)
|
Open Access
Non-returning deterministic and nondeterministic finite automata with translucent lettersRAIRO-Theor. Inf. Appl., 57 (2023) 8
Published online: 18 October 2023
|
|
Open Access
Human-verifiable proofs in the theory of word-representable graphsRAIRO-Theor. Inf. Appl., 58 (2024) 9
Published online: 26 March 2024
|
|
Open Access
On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducersRAIRO-Theor. Inf. Appl., 55 (2021) 5
Published online: 22 July 2021
|
|
Open Access
Explicit values of a q-multiple zeta-star function at roots of unityRAIRO-Theor. Inf. Appl., 59 (2025) 5
Published online: 19 August 2025
|
|
Open Access
On the accepting state complexity of operations on permutation automataRAIRO-Theor. Inf. Appl., 57 (2023) 9
Published online: 07 November 2023
|
