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
| 19 |
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
Complément à l'étude des suites de Thue-Morse généraliséesRAIRO-Theor. Inf. Appl., 20 2 (1986) 157-181
Published online: 01 February 2017
|
| 7 |
Free Access
Real time recognition with cellular automata : a meaningful exampleRAIRO-Theor. Inf. Appl., 27 2 (1993) 97-120
Published online: 01 February 2017
|
| 5 |
Free Access
The reduction of binary trees by means of an input-restricted dequeRAIRO. Inform. théor., 17 3 (1983) 249-284
Published online: 01 February 2017
|
| 5 |
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
|
