Geodesic

Sommaire du Fascicule no. 1

A note on a conjecture of Duval and sturmian words
p. 1-3
Polypodic codes
p. 5-28
Relating automata-theoretic hierarchies to complexity-theoretic hierarchies
p. 29-42
Pipelined decomposable BSP computers
p. 43-65
On the distribution of characteristic parameters of words
p. 67-96
On the distribution of characteristic parameters of words II
p. 97-127

Sommaire du Fascicule no. 2

Preface
p. vii
A fully equational proof of Parikh's theorem
p. 129-153
Semantics of value recursion for monadic input/output
p. 155-180
Feedback, trace and fixed-point semantics
p. 181-194
μ-bicomplete categories and parity games
p. 195-227

Sommaire du Fascicule no. 3

Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs
p. 229-247
Words over an ordered alphabet and suffix permutations
p. 249-259
Permissive strategies : from parity games to safety games
p. 261-275
On the size of one-way quantum finite automata with periodic behaviors
p. 277-291
On multiplicatively dependent linear numeration systems, and periodic points
p. 293-314
Density of critical factorizations
p. 315-327

Sommaire du Fascicule no. 4

An upper bound on the space complexity of random formulae in resolution
p. 329-339
About the decision of reachability for register machines
p. 341-358
On shuffle ideals
p. 359-384
On a characteristic property of Arnoux-Rauzy sequences
p. 385-388
Integer partitions, tilings of 2D-gons and lattices
p. 389-399