Geodesic

Sommaire du Fascicule no. 1

Foreword
p. 1
Morphisms fixing words associated with exchange of three intervals
p. 3-17
Radix enumeration of rational languages
p. 19-36
On the computation of covert channel capacity
p. 37-58
How to build billiard words using decimations
p. 59-77
Formal language properties of hybrid systems with strong resets
p. 79-111
Infinite words containing squares at every position
p. 113-124
On the number of squares in partial words
p. 125-138
The critical exponent of the Arshon words
p. 139-150
Binary words avoiding the pattern AABBCABBA
p. 151-158
Standard factors of sturmian words
p. 159-174
On the growth rates of complexity of threshold languages
p. 175-192

Sommaire du Fascicule no. 2

Unambiguous erasing morphisms in free monoids
p. 193-208
Generalizations of Parikh mappings
p. 209-228
Extending regular expressions with homomorphic replacement
p. 229-255
On the syntactic complexity of tree series
p. 257-279

Sommaire du Fascicule no. 3

On the D0L repetition threshold
p. 281-292
Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
p. 293-311
Balances and abelian complexity of a certain class of infinite ternary words
p. 313-337
Corrigendum to our paper : How expressions can code for automata
p. 339-361
The uniform minimum-ones 2SAT problem and its application to haplotype classification
p. 363-377
Function operators spanning the arithmetical and the polynomial hierarchy
p. 379-418

Sommaire du Fascicule no. 4

Quantum coherent spaces and linear logic
p. 419-441
Sturmian jungle (or garden?) on multiliteral alphabets
p. 443-470
Classes of two-dimensional languages and recognizability conditions
p. 471-488
The code problem for directed figures
p. 489-506
Translation from classical two-way automata to pebble two-way automata
p. 507-523
A CAT algorithm for the exhaustive generation of ice piles
p. 525-543