Upper bound for palindromic and factor complexity of rich words
RAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
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
-
-
Open Access
Betweenness of partial orders
RAIRO-Theor. Inf. Appl., 54 (2020) 7Published online: 16 December 2020 -
The weak circular repetition threshold over large alphabets
RAIRO-Theor. Inf. Appl., 54 (2020) 6Published online: 02 November 2020 -
On universal partial words for word-patterns and set partitions
RAIRO-Theor. Inf. Appl., 54 (2020) 5Published online: 04 June 2020 -
Open Access
Injective envelopes of transition systems and Ferrers languages
RAIRO-Theor. Inf. Appl., 54 (2020) 4Published online: 19 May 2020 -
Linear automata with translucent letters and linear context-free trace languages
RAIRO-Theor. Inf. Appl., 54 (2020) 3Published online: 10 April 2020
| 14 |
Free Access
Pour en finir avec la dérécursivation du problème des tours de HanoïRAIRO-Theor. Inf. Appl., 24 1 (1990) 17-35
Published online: 01 February 2017
|
| 9 |
Free Access
On the difficulty of finding walks of length kRAIRO-Theor. Inf. Appl., 31 5 (1997) 429-435
Published online: 01 February 2017
|
| 7 |
Free Access
Algorithme de Bareiss, algorithme des sous-résultantsRAIRO-Theor. Inf. Appl., 30 4 (1996) 319-347
Published online: 01 February 2017
|
| 7 |
Free Access
La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, LovászRAIRO-Theor. Inf. Appl., 23 3 (1989) 345-376
Published online: 01 February 2017
|
| 6 |
Free Access
A limit theorem for “quicksort”RAIRO-Theor. Inf. Appl., 25 1 (1991) 85-100
Published online: 01 February 2017
|
