Sommaire du Fascicule no. 1

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

Sommaire du Fascicule no. 2-3-4

Preface: Non-classical models of automata and applications VIII
Diving into the queue
Uncountable classical and quantum complexity classes
On bonded sequential and parallel insertion systems
The complexity of concatenation on deterministic and alternating finite automata
Randomized generation of error control codes with automata and transducers
On double-jumping finite automata and their closure properties
Expressive capacity of subregular expressions
Regular and linear permutation languages
Automata with cyclic move operations for picture languages
Language classes associated with automata over matrix groups