Tome 33 (1999) no. 2

Sommaire

On the complexity of the hidden weighted bit function for various BDD models
p. 103-115
Undecidability of the equivalence of finite substitutions on regular language
p. 117-124
On sequences defined by D0L power series
p. 125-132
Construction of a deterministic ω-automaton using derivatives
p. 133-158
Immunity and simplicity for exact counting and other counting classes
p. 159-176
On the median-of-k version of Hoare’s selection algorithm
p. 177-192
Communication complexity and lower bounds on multilective computations
p. 193-212