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
A partially persistent data structure for the set-union problemRAIRO-Theor. Inf. Appl., 24 2 (1990) 189-202
Published online: 01 February 2017
|
| 4 |
Free Access
Transductions de forêts reconnaissables monadiques, forêts corégulièresR.A.I.R.O. Informatique théorique, 10 R1 (1976) 5-28
Published online: 01 February 2017
|
| 3 |
Free Access
Reducibility as a tool to extend the power of approximation algorithms the minimization of boolean expressionsRAIRO. Inform. théor., 11 1 (1977) 75-82
Published online: 01 February 2017
|
| 3 |
Free Access
Verschränkte homomorphismen formaler sprachenRAIRO. Inform. théor., 14 2 (1980) 193-208
Published online: 01 February 2017
|
| 3 |
Free Access
Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatèresRAIRO-Theor. Inf. Appl., 26 3 (1992) 205-219
Published online: 01 February 2017
|
