Sommaire du Fascicule no. 1

Algebraic and topological theory of languages
Uniformly growing backtrack trees
A note on read-k times branching programs

Sommaire du Fascicule no. 2

Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique
On morphically generated formal power series
On parallel deletions applied to a word
On codes having no finite completion

Sommaire du Fascicule no. 3

Equations on the semidirect product of a finite semilattice by a 𝒥-trivial monoid of height k
Binary trees, fringe thickness and minimum path length
Fibrations and recursivity
Schützenberger-like products in non-free monoids
On-line computations of the ideal lattice of posets
Comments on the analysis of parameters in a Random Graph Model

Sommaire du Fascicule no. 4

Analysis of quickselect : an algorithm for order statistics
Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable
Minimum complexity of automatic non sturmian sequences
Entiers intuitionnistes et entiers classiques en λC-calcul
Sémantique du parallélisme et du choix du langage Electre

Sommaire du Fascicule no. 5

Unavoidable languages, cuts and innocent sets of words
Token transfer in a faulty network
Mineurs d'arbres avec racines
Optimal on-line coloring of circular arc graphs
On-line evaluation of powers using Euclid's algorithm

Sommaire du Fascicule no. 6

Parallel algorithms on interval graphs
Complexity of E0L structural equivalence
On bandwidth, cutwidth, and quotient graphs
Cutwidth of the de Bruijn graph
Une condition impliquant toutes les identités rationnelles