Sommaire du Fascicule no. 1

Spécialisation de la suite de Sturm
Using persistent data structures for adding range restrictions to searching problems
On deciding some equivalences for concurrent processes

Sommaire du Fascicule no. 2

Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes

Sommaire du Fascicule no. 3-4

Special issue for Professor Karel Culik II : 60 th birthday

Preface
Generalized ternary simulation of sequential circuits
Multidimensional linear congruential graphs
Theory as basis for advances in hypermedia
A proof of protocol correctness
Pumping and pushdown machines
Finite degrees of ambiguity in pattern languages
A remark on morphic sturmian words
Bijective sequential mappings of a free monoid onto another
On semigroups of matrices over the tropical semiring
The intersection problem for alphabetic vector monoids
The complexity of systolic dissemination of information in interconnection networks
Arithmetic coding of weighted finite automata
Fractals, dimension, and formal languages
On continuous functions computed by finite automata
Fractal geometry, Turing machines and divide-and-conquer recurrences
Publications of K. Culik

Sommaire du Fascicule no. 5

Updating approximately complete trees
Decidability of equivalence for a class of non-deterministic tree transducers
A hierarchy that does not collapse : alternations in low level space

Sommaire du Fascicule no. 6

Toward a semantics for the QUEST language
Pebbling dynamic graphs in minimal space
The Hamilton circuit problem on grids