Geodesic

Sommaire du Fascicule no. 1

Rational series with high image complexity
p. 1-6
Analysis of digital search trees incorporated with paging
p. 7-15
Relationships between vertex attack tolerance and other vulnerability parameters
p. 17-27
The determinacy strength of pushdown ω-languages
p. 29-50

Sommaire du Fascicule no. 2

Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
p. 51-70
The connectivity and nature diagnosability of expanded k-ary n-cubes
p. 71-89
A Better bound of randomized algorithms for the multislope ski-rental problem
p. 91-98
Minimal partial languages and automata
p. 99-119

Sommaire du Fascicule no. 3

Bipartite binomial heaps
p. 121-133
Interval exchanges, admissibility and branching Rauzy induction
p. 135-139
Non-primitive words of the form 𝐩𝐪 𝐦
p. 141-166

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”
p. 167
Translation of a Digital Line into another according to various Digitization Processes
p. 169-180
On avoidability of formulas with reversal
p. 181-189
Cellular automata and powers of p∕q
p. 191-204
A uniform cube-free morphism is k-power-free for all integers k ≥ 4
p. 205-216