Tome 11 (1977) no. 1

Sommaire

Note sur la suppression des étiquettes en programmation
p. 3-16
The decidability of the equivalence problem for polynomially bounded DOL sequences
p. 17-28
Cônes rationnels commutativement clos
p. 29-51
Characterizations of the Dyck sets
p. 53-62
Sémantique des structures de contrôle
p. 63-74
Reducibility as a tool to extend the power of approximation algorithms the minimization of boolean expressions
p. 75-82