Sommaire du Fascicule no. 1

Rational series with high image complexity
Analysis of digital search trees incorporated with paging
Relationships between vertex attack tolerance and other vulnerability parameters
The determinacy strength of pushdown ω-languages

Sommaire du Fascicule no. 2

Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
The connectivity and nature diagnosability of expanded k-ary n-cubes
A Better bound of randomized algorithms for the multislope ski-rental problem
Minimal partial languages and automata

Sommaire du Fascicule no. 3

Bipartite binomial heaps
Interval exchanges, admissibility and branching Rauzy induction
Non-primitive words of the form 𝐩𝐪 𝐦

Sommaire du Fascicule no. 4

Special issue dedicated to the 16th "Journées Montoises d’Informatique Théorique"

Foreword to the special issue dedicated to the sixteenth “Journées Montoises d’Informatique Théorique”
Translation of a Digital Line into another according to various Digitization Processes
On avoidability of formulas with reversal
Cellular automata and powers of p∕q
A uniform cube-free morphism is k-power-free for all integers k ≥ 4