Tome 52 (2018) no. 1

Sommaire

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
p. 1-21
State hyperstructures of tree automata based on lattice-valued logic
p. 23-42
Minimum parametric flow in time-dependent dynamic networks
p. 43-53
The inclusion structure of partially lossy queue monoids and their trace submonoids
p. 55-86