Geodesic

Sommaire du Fascicule no. 1

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

Sommaire du Fascicule no. 2-3-4

Preface: Non-classical models of automata and applications VIII
p. 87-88
Diving into the queue
p. 89-110
Uncountable classical and quantum complexity classes
p. 111-126
On bonded sequential and parallel insertion systems
p. 127-151
The complexity of concatenation on deterministic and alternating finite automata
p. 153-168
Randomized generation of error control codes with automata and transducers
p. 169-184
On double-jumping finite automata and their closure properties
p. 185-199
Expressive capacity of subregular expressions
p. 201-218
Regular and linear permutation languages
p. 219-234
Automata with cyclic move operations for picture languages
p. 235-251
Language classes associated with automata over matrix groups
p. 253-268