Issue no. 1 Table of Contents

Tours de Hanoï et automates
Pour en finir avec la dérécursivation du problème des tours de Hanoï
Inevitability in diamond processes
Two-way automaton computations
Bi-infinitary codes
The structure of index sets and reduced indexed grammars

Issue no. 2 Table of Contents

Solving word equations
Parallélisation sémantique
Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander
A partially persistent data structure for the set-union problem

Issue no. 3 Table of Contents

A combinatorial theorem on p-power-free words and an application to semigroups
A note on separating the relativized polynomial time hierarchy by immune sets
Epsilon weak precedence grammars and languages
Complexity of boundary graph languages
Context-free languages with rational index in Θ(n γ ) for algebraic numbers γ

Issue no. 4 Table of Contents

Loops in automata and HDTOL relations
Graphes canoniques de graphes algébriques
Parallélisation d'algorithmes avec un nombre fixe de processeurs
Factorisation sur ℤ[X] des polynômes de degré élevé à l’aide d’un monomorphisme
Complete subgraphs of bipartite graphs and applications to trace languages
Une remarque sur les systèmes complets d'identités rationnelles

Issue no. 5 Table of Contents

On algebraic specifications of computable algebras with the discriminator technique
On a class of infinitary codes
Elementariness of a finite set of words is co-NP-complete
On geometric automata which can nondeterministically choose auxiliary points
Comparison of basic language generating devices (non-deterministic systems)

Issue no. 6 Table of Contents

Partially abelian squarefree words
On dot-depth two
Speeding up the computations on an elliptic curve using addition-subtraction chains
Saturating right congruences
Spécialisation de la suite de Sturm et sous-résultants (I)