On the length of uncompletable words in unambiguous automata
RAIRO-Theor. Inf. Appl., Publication ahead of print
Published online: 26 April 2019
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
-
-
An efficient certificateless multi-receiver threshold decryption scheme
RAIRO-Theor. Inf. Appl., 53 1-2 (2019) 67-84Published online: 15 February 2019 -
Uncountable classical and quantum complexity classes
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 111-126Published online: 07 February 2019 -
Regular and linear permutation languages
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 219-234Published online: 07 February 2019 -
Randomized generation of error control codes with automata and transducers
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 169-184Published online: 29 January 2019 -
The complexity of concatenation on deterministic and alternating finite automata
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 153-168Published online: 24 January 2019
| 6 |
Free Access
On a tree collision resolution algorithm in presence of captureRAIRO-Theor. Inf. Appl., 26 2 (1992) 163-197
Published online: 01 February 2017
|
| 5 |
Free Access
Sur l'image, par une transduction rationnelle, des mots sur une lettreR.A.I.R.O. Informatique théorique, 9 R2 (1975) 25-37
Published online: 01 February 2017
|
| 5 |
Free Access
On languages satisfying Ogden's lemmaRAIRO. Inform. théor., 12 3 (1978) 201-202
Published online: 01 February 2017
|
| 4 |
Free Access
Computing the connected components of simple rectilinear geometrical objects in $d$-spaceRAIRO. Inform. théor., 18 2 (1984) 171-183
Published online: 01 February 2017
|
| 4 |
Free Access
Editorial
Special issue dedicated to the thirteenth "Journées Montoises d'Informatique Théorique"RAIRO-Theor. Inf. Appl., 46 1 (2012) 1
Published online: 13 February 2012
|
