Geodesic

Sommaire du Fascicule no. 1

Prescribed ultrametrics
p. 1-5
On the structure of recognizable languages of dependence graphs
p. 7-22
A fast algorithm to decide on the equivalence of stateless DPDA
p. 23-48
Efficient reductions of picture words
p. 49-56
PCP-prime words and primality types
p. 57-70
On languages satisfying “interchange lemma”
p. 71-79

Sommaire du Fascicule no. 2

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

Sommaire du Fascicule no. 3

Limiting characterizations of low level space complexity classes
p. 175-182
Objects in relational database schemes with functional, inclusion, and exclusion dependencies
p. 183-219
CPO-models for second order lambda calculus with recursive types and subtyping
p. 221-260
Pm numbers, ambiguity, and regularity
p. 261-275

Sommaire du Fascicule no. 4

On the positive and the inversion complexity of Boolean functions
p. 283-293
Space-efficient parallel merging
p. 295-310
An economical transformation of graph grammars
p. 311-325
On the restricted equivalence for subclasses of propositional logic
p. 327-340
An algorithm to compute the möbius function of the rotation lattice of binary trees
p. 341-348
Sublogarithmic ∑ 2 -space is not closed under complement and other separation results
p. 349-366
Performance considerations on a random graph model for parallel processing
p. 367-388

Sommaire du Fascicule no. 5

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

Sommaire du Fascicule no. 6

Autonomous posets and quantales
p. 483-501
An imperative language based on distributive categories II
p. 503-522
Retrieving library functions by unifying types modulo linear isomorphism
p. 523-540
On the average number of registers needed to evaluate a special class of backtrack trees
p. 541-554
A unified approach to control problems in discrete event processes
p. 555-573