Open Access
Meanders and Dyck-Path Billiards
RAIRO-Theor. Inf. Appl., 59 (2025) 3
Published online: 30 July 2025
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
Image encryption using novel chaotic map and cellular automata dynamics
RAIRO-Theor. Inf. Appl., 59 (2025) 2Published online: 28 July 2025 -
Open Access
Propagating Sets in Sierpiński Fractal Graphs
RAIRO-Theor. Inf. Appl., 59 (2025) 1Published online: 03 January 2025 -
Open Access
Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees
RAIRO-Theor. Inf. Appl., 58 (2024) 18Published online: 19 December 2024 -
Open Access
Creating a network-state homomorphism through optimization
RAIRO-Theor. Inf. Appl., 58 (2024) 17Published online: 25 November 2024 -
Open Access
On the generation of discrete figures with connectivity constraints
RAIRO-Theor. Inf. Appl., 58 (2024) 16Published online: 28 August 2024
|
Open Access
Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck pathsRAIRO-Theor. Inf. Appl., 58 (2024) 8
Published online: 22 March 2024
|
|
Free Access
Upper bound for palindromic and factor complexity of rich wordsRAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
|
|
Free Access
Editorial
In memoriam: Philippe Flajolet, the father of analytic combinatoricsRAIRO-Theor. Inf. Appl., 45 4 (2011) 371-373
Published online: 22 August 2011
|
|
Free Access
On subdirectly irreducible automataRAIRO. Inform. théor., 15 1 (1981) 23-46
Published online: 01 February 2017
|
|
Free Access
On equality sets of morphisms in topological free monoidsRAIRO-Theor. Inf. Appl., 25 1 (1991) 39-42
Published online: 01 February 2017
|
Recent articles (published in the past 5 years)
Linear automata with translucent letters and linear context-free trace languagesRAIRO-Theor. Inf. Appl., 54 (2020) 3
Published online: 10 April 2020
|
|
Open Access
Non-returning deterministic and nondeterministic finite automata with translucent lettersRAIRO-Theor. Inf. Appl., 57 (2023) 8
Published online: 18 October 2023
|
Total edge–vertex dominationRAIRO-Theor. Inf. Appl., 54 (2020) 1
Published online: 28 February 2020
|
|
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
Human-verifiable proofs in the theory of word-representable graphsRAIRO-Theor. Inf. Appl., 58 (2024) 9
Published online: 26 March 2024
|
