Sommaire du Fascicule no. 1

Prescribed ultrametrics
On the structure of recognizable languages of dependence graphs
A fast algorithm to decide on the equivalence of stateless DPDA
Efficient reductions of picture words
PCP-prime words and primality types
On languages satisfying “interchange lemma”

Sommaire du Fascicule no. 2

An approach to parallel algorithm design
Real time recognition with cellular automata : a meaningful example
Majoration de la norme des facteurs d'un polynôme : cas où toutes les racines du polynôme sont réelles
On ranking 1-way finitely ambiguous NL languages and #P 1 -complete census functions
Holonomic functions and their relation to linearly constrained languages
On searching for roots of a polynomial in a circular annulus

Sommaire du Fascicule no. 3

Limiting characterizations of low level space complexity classes
Objects in relational database schemes with functional, inclusion, and exclusion dependencies
CPO-models for second order lambda calculus with recursive types and subtyping
Pm numbers, ambiguity, and regularity

Sommaire du Fascicule no. 4

On the positive and the inversion complexity of Boolean functions
Space-efficient parallel merging
An economical transformation of graph grammars
On the restricted equivalence for subclasses of propositional logic
An algorithm to compute the möbius function of the rotation lattice of binary trees
Sublogarithmic ∑ 2 -space is not closed under complement and other separation results
Performance considerations on a random graph model for parallel processing

Sommaire du Fascicule no. 5

Fast diagnosis of multiprocessor systems with random faults
Language classes defined by time-bounded relativised cellular automata
Combinatorial properties of texts
Congestion optimale du plongement de l’hypercube H(n) dans la chaîne P(2 n )

Sommaire du Fascicule no. 6

Autonomous posets and quantales
An imperative language based on distributive categories II
Retrieving library functions by unifying types modulo linear isomorphism
On the average number of registers needed to evaluate a special class of backtrack trees
A unified approach to control problems in discrete event processes