Open Access
Creating a network-state homomorphism through optimization
RAIRO-Theor. Inf. Appl., 58 (2024) 17
Published online: 25 November 2024
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 wordsRAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
|
Free Access
Algorithmes pour vérifier la conjecture de SyracuseRAIRO-Theor. Inf. Appl., 21 1 (1987) 3-9
Published online: 01 February 2017
|
Open Access
Creating a network-state homomorphism through optimizationRAIRO-Theor. Inf. Appl., 58 (2024) 17
Published online: 25 November 2024
|
Free Access
A note on the undecidability of contextfreenessRAIRO. Inform. théor., 16 1 (1982) 3-11
Published online: 01 February 2017
|
Free Access
Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langagesRAIRO-Theor. Inf. Appl., 20 3 (1986) 291-318
Published online: 01 February 2017
|
Linear automata with translucent letters and linear context-free trace languagesRAIRO-Theor. Inf. Appl., 54 (2020) 3
Published online: 10 April 2020
|
On the power of two-way multihead quantum finite automataRAIRO-Theor. Inf. Appl., 53 1-2 (2019) 19-35
Published online: 15 January 2019
|
Total edge–vertex dominationRAIRO-Theor. Inf. Appl., 54 (2020) 1
Published online: 28 February 2020
|
Circular critical exponents for Thue–Morse factorsRAIRO-Theor. Inf. Appl., 53 1-2 (2019) 37-49
Published online: 17 January 2019
|
Open Access
Non-returning deterministic and nondeterministic finite automata with translucent lettersRAIRO-Theor. Inf. Appl., 57 (2023) 8
Published online: 18 October 2023
|