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
| 8 |
Free Access
Separating words with machines and groupsRAIRO-Theor. Inf. Appl., 30 1 (1996) 81-86
Published online: 01 February 2017
|
| 3 |
Free Access
A new class of balanced search trees : half-balanced binary search tressRAIRO. Inform. théor., 16 1 (1982) 51-71
Published online: 01 February 2017
|
| 3 |
Free Access
Speeding up the computations on an elliptic curve using addition-subtraction chainsRAIRO-Theor. Inf. Appl., 24 6 (1990) 531-543
Published online: 01 February 2017
|
| 3 |
Free Access
Algorithms for weighted graph problems on the modified cellular graph automatonRAIRO-Theor. Inf. Appl., 23 3 (1989) 251-279
Published online: 01 February 2017
|
| 3 |
Free Access
On the hierarchy of Petri net languagesRAIRO. Inform. théor., 13 1 (1979) 19-30
Published online: 01 February 2017
|
