Open Access
Propagating Sets in Sierpiński Fractal Graphs
RAIRO-Theor. Inf. Appl., 59 (2025) 1
Published online: 03 January 2025
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
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
Implementing term rewriting by jungle evaluation
Berthold Hoffmann and Detlef Plump
RAIRO-Theor. Inf. Appl., 25 5 (1991) 445-472
Published online: 01 February 2017
|
Open Access
Propagating Sets in Sierpiński Fractal Graphs
J. Anitha, Indra Rajasingh and Hossein Rashmanlou
RAIRO-Theor. Inf. Appl., 59 (2025) 1
Published online: 03 January 2025
|
Free Access
Algorithmes pour vérifier la conjecture de Syracuse
Jacques Arsac
RAIRO-Theor. Inf. Appl., 21 1 (1987) 3-9
Published online: 01 February 2017
|
Free Access
Tours de Hanoï et automates
J.-P. Allouche and F. Dress
RAIRO-Theor. Inf. Appl., 24 1 (1990) 1-15
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
|
Free Access
Algorithmes pour vérifier la conjecture de Syracuse
Jacques Arsac
RAIRO-Theor. Inf. Appl., 21 1 (1987) 3-9
Published online: 01 February 2017
|
Free Access
Characterization and lower bounds for additive charges for heterogeneous questionnaires
Bhu Dev Sharma and Asha Garg
RAIRO. Inform. théor., 13 4 (1979) 383-393
Published online: 01 February 2017
|
Open Access
Propagating Sets in Sierpiński Fractal Graphs
J. Anitha, Indra Rajasingh and Hossein Rashmanlou
RAIRO-Theor. Inf. Appl., 59 (2025) 1
Published online: 03 January 2025
|
Free Access
Hotz-isomorphism theorems in formal language theory
Volker Diekert and Axel Möbus
RAIRO-Theor. Inf. Appl., 23 1 (1989) 29-43
Published online: 03 February 2017
|
Free Access
A simple proof of Valiant's lemma
Hermann K.-G. Walter
RAIRO-Theor. Inf. Appl., 20 2 (1986) 183-190
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
|
Free Access
Algorithmes pour vérifier la conjecture de Syracuse
Jacques Arsac
RAIRO-Theor. Inf. Appl., 21 1 (1987) 3-9
Published online: 01 February 2017
|
Free Access
Characterization and lower bounds for additive charges for heterogeneous questionnaires
Bhu Dev Sharma and Asha Garg
RAIRO. Inform. théor., 13 4 (1979) 383-393
Published online: 01 February 2017
|
Free Access
Hotz-isomorphism theorems in formal language theory
Volker Diekert and Axel Möbus
RAIRO-Theor. Inf. Appl., 23 1 (1989) 29-43
Published online: 03 February 2017
|
Linear automata with translucent letters and linear context-free trace languages
Benedek Nagy and Friedrich Otto
RAIRO-Theor. Inf. Appl., 54 (2020) 3
Published online: 10 April 2020
|
Total edge–vertex domination
Abdulgani Sahin and Bünyamin Sahin
RAIRO-Theor. Inf. Appl., 54 (2020) 1
Published online: 28 February 2020
|
Open Access
A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes
Roumaissa Mahdjoubi, Pierre Louis Cayrel, Sedat Akleylek and Guenda Kenza
RAIRO-Theor. Inf. Appl., 55 (2021) 10
Published online: 17 September 2021
|
Open Access
Digging input-driven pushdown automata
Martin Kutrib and Andreas Malcher
RAIRO-Theor. Inf. Appl., 55 (2021) 6
Published online: 22 July 2021
|
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
|
*JCR, Clarivate Analytics © 2024
Editor-in-Chief: Enrico FORMENTI
eISSN: 2804-7346
Open Math through S2O partnership
More information