Geodesic

Sommaire du Fascicule no. 1

Spécialisation de la suite de Sturm
p. 1-24
Using persistent data structures for adding range restrictions to searching problems
p. 25-49
On deciding some equivalences for concurrent processes
p. 51-71

Sommaire du Fascicule no. 2

Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
p. 73-124
Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
p. 125-149

Sommaire du Fascicule no. 3-4

Special issue for Professor Karel Culik II : 60 th birthday

Preface
p. 155-157
Generalized ternary simulation of sequential circuits
p. 159-186
Multidimensional linear congruential graphs
p. 187-199
Theory as basis for advances in hypermedia
p. 201-211
A proof of protocol correctness
p. 213-220
Pumping and pushdown machines
p. 221-232
Finite degrees of ambiguity in pattern languages
p. 233-253
A remark on morphic sturmian words
p. 255-263
Bijective sequential mappings of a free monoid onto another
p. 265-276
On semigroups of matrices over the tropical semiring
p. 277-294
The intersection problem for alphabetic vector monoids
p. 295-301
The complexity of systolic dissemination of information in interconnection networks
p. 303-342
Arithmetic coding of weighted finite automata
p. 343-360
Fractals, dimension, and formal languages
p. 361-386
On continuous functions computed by finite automata
p. 387-403
Fractal geometry, Turing machines and divide-and-conquer recurrences
p. 405-423
Publications of K. Culik
p. 425-430

Sommaire du Fascicule no. 5

Updating approximately complete trees
p. 431-446
Decidability of equivalence for a class of non-deterministic tree transducers
p. 447-463
A hierarchy that does not collapse : alternations in low level space
p. 465-512

Sommaire du Fascicule no. 6

Toward a semantics for the QUEST language
p. 513-555
Pebbling dynamic graphs in minimal space
p. 557-565
The Hamilton circuit problem on grids
p. 567-582