Sommaire du Fascicule no. 1

Succession rules and deco polyominoes
Encoding fix in object calculi
Threshold circuits for iterated matrix product and powering
On codes with finite interpreting delay : a defect theorem
Construction of very hard functions for multiparty communication complexity
A characterization of poly-slender context-free languages

Sommaire du Fascicule no. 2

Perfect matching in general vs. cubic graphs : a note on the planar and bipartite cases
Iteration of rational transductions
Three generators for minimal writing-space computations
Asynchronous sliding block maps
On the decidability of the equivalence problem for monadic recursive programs

Sommaire du Fascicule no. 3

Approximation algorithms for the traveling salesman problem with range condition
Closure under union and composition of iterated rational transductions
Improved lower bounds on the approximability of the traveling salesman problem

Sommaire du Fascicule no. 4

Computing ε-free NFA from regular expressions in O(nlog 2 (n)) time
On the Horton-Strahler number for combinatorial tries
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
Semi-commutations and partial commutations

Sommaire du Fascicule no. 5

A lower bound for reversible automata
Return words in sturmian and episturmian words
A space lower bound for acceptance by one-way Π 2 -alternating machines
On a paper by Castelli, Mignosi, Restivo
Local transition functions of quantum Turing machines
Complexité et automates cellulaires linéaires

Sommaire du Fascicule no. 6

Finite presentability of strongly finite dilators
Domain-free λμ-calculus
Two-variable word equations
Computing the prefix of an automaton
Cutwidth of the r-dimensional mesh of d-ary trees
Galois lattice as a framework to specify building class hierarchies algorithms
A compositional approach to synchronize two dimensional networks of processors
Characteristic formulae for timed automata
Codes générateurs minimaux de langages de mots bi-infinis