Tome 34 (2000) no. 6

Sommaire

Finite presentability of strongly finite dilators
p. 425-431
Domain-free λμ-calculus
p. 433-466
Two-variable word equations
p. 467-501
Computing the prefix of an automaton
p. 503-514
Cutwidth of the r-dimensional mesh of d-ary trees
p. 515-519
Galois lattice as a framework to specify building class hierarchies algorithms
p. 521-548
A compositional approach to synchronize two dimensional networks of processors
p. 549-564
Characteristic formulae for timed automata
p. 565-584
Codes générateurs minimaux de langages de mots bi-infinis
p. 585-596