Sommaire du Fascicule no. 1

Foreword
On the hierarchies of Δ 2 0 -real numbers
Automata, Borel functions and real numbers in Pisot base
Real and complex pseudozero sets for polynomials with applications
Formally certified floating-point filters for homogeneous geometric predicates
Correct rounding of algebraic functions
Fast and correctly rounded logarithms in double-precision
Multiple-precision correctly rounded Newton-Cotes quadrature

Sommaire du Fascicule no. 2

Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers
Returning and non-returning parallel communicating finite automata are equivalent
An algorithm for deciding if a polyomino tiles the plane
Sequential monotonicity for restarting automata
Three notes on the complexity of model checking fixpoint logic with chop
Object oriented institutions to specify symbolic computation systems
A periodicity property of iterated morphisms
Deciding inclusion of set constants over infinite non-strict data structures

Sommaire du Fascicule no. 3

Decidability of code properties
An upper bound for transforming self-verifying automata into deterministic ones
Substitutions par des motifs en dimension 1
A graph approach to computing nondeterminacy in substitutional dynamical systems
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
On substitution invariant sturmian words : an application of Rauzy fractals

Sommaire du Fascicule no. 4

Learning tree languages from text
A weighted HP model for protein folding with diagonal contacts
Defect theorem in the plane
Uniformly bounded duplication codes
Combinatoire de mots récurrents de complexité n+2
Recursive coalgebras of finitary functors