Open Access
Quasi-deterministic finite one-head and two-head automata
RAIRO-Theor. Inf. Appl., 60 (2026) 2
Published online: 03 February 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
On bisimulation in absence of restriction
RAIRO-Theor. Inf. Appl., 60 (2026) 1Published online: 16 January 2026 -
Open Access
Efficient k-mer dataset compression using Eulerian covers of de Bruijn graphs and BWT
RAIRO-Theor. Inf. Appl., 59 (2025) 20Published online: 05 December 2025 -
Open Access
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
RAIRO-Theor. Inf. Appl., 59 (2025) 21Published online: 03 December 2025 -
Open Access
Smooth convex polyiamonds
RAIRO-Theor. Inf. Appl., 59 (2025) 17Published online: 19 November 2025 -
Open Access
A symmetry property of Christoffel words
RAIRO-Theor. Inf. Appl., 59 (2025) 18Published online: 19 November 2025
|
Free Access
Enumerating Davenport-Schinzel sequencesRAIRO-Theor. Inf. Appl., 26 5 (1992) 387-402
Published online: 01 February 2017
|
|
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
Efficient counting of k-convex polyominoesRAIRO-Theor. Inf. Appl., 59 (2025) 11
Published online: 15 October 2025
|
|
Open Access
Synchronizing series-parallel deterministic finite automata with loops and related problemsRAIRO-Theor. Inf. Appl., 55 (2021) 7
Published online: 22 July 2021
|
|
Free Access
The simplest binary word with only three squaresRAIRO-Theor. Inf. Appl., 55 (2021) 3
Published online: 20 April 2021
|
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
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
Human-verifiable proofs in the theory of word-representable graphsRAIRO-Theor. Inf. Appl., 58 (2024) 9
Published online: 26 March 2024
|
|
Open Access
On the accepting state complexity of operations on permutation automataRAIRO-Theor. Inf. Appl., 57 (2023) 9
Published online: 07 November 2023
|
