RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 52 (2018) no. 1

Sommaire

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

Fernau, Henning ; Kuppusamy, Lakshmanan ; Raman, Indhumathi

p. 1-21

State hyperstructures of tree automata based on lattice-valued logic

Ghorani, Maryam

p. 23-42

Minimum parametric flow in time-dependent dynamic networks

Parpalea, Mircea ; Avesalon, Nicoleta ; Ciurea, Eleonor

p. 43-53

The inclusion structure of partially lossy queue monoids and their trace submonoids

Köcher, Chris ; Kuske, Dietrich ; Prianychnykova, Olena

p. 55-86