Sommaire

On some path problems on oriented hypergraphs

Nguyen, S. ; Pretolani, D. ; Markenzon, L.

Access to full text
Full (PDF)
Full (DJVU)
p. 1-20

Numdam
Towards parallelization of concurrent systems

Corradini, F. ; Gorrieri, R. ; Marchignoli, D.

Access to full text
Full (PDF)
Full (DJVU)
p. 99-125

Numdam
Sur les automates circulaires et la conjecture de Černý

Dubuc, L.

Access to full text
Full (PDF)
Full (DJVU)
p. 21-34

Numdam
Finite idempotent groupoids and regular languages

Beaudry, M.

Access to full text
Full (PDF)
Full (DJVU)
p. 127-140

Numdam
Semantics of flowchart programs and the free Conway theories

Bernátsky, L. ; Ésik, Z.

Access to full text
Full (PDF)
Full (DJVU)
p. 35-78

Numdam
Analysis of algorithms for the recognition of rational and context-free trace languages

Avellone, A. ; Goldwurm, M.

Access to full text
Full (PDF)
Full (DJVU)
p. 141-152

Numdam
On the inclusion problem for finitely ambiguous rational trace languages

Bertoni, A. ; Massazza, P.

Access to full text
Full (PDF)
Full (DJVU)
p. 79-98

Numdam
Associative closure and periodicity of ω-words

Mateescu, A. ; Mateescu, G. D.

Access to full text
Full (PDF)
Full (DJVU)
p. 153-174

Numdam
Shuffle binoids

Bloom, S. L. ; Ésik, Z.

Access to full text
Full (PDF)
Full (DJVU)
p. 175-198

Numdam