RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 2

Sommaire

On the complexity of the hidden weighted bit function for various BDD models

Bollig, Beate ; Löbbing, Martin ; Sauerhoff, Martin ; Wegener, Ingo

p. 103-115

Undecidability of the equivalence of finite substitutions on regular language

Halava, Vesa ; Harju, Tero

p. 117-124

On sequences defined by D0L power series

Honkala, Juha

p. 125-132

Construction of a deterministic

ω

-automaton using derivatives

Redziejowski, Roman R.

p. 133-158

Immunity and simplicity for exact counting and other counting classes

Rothe, J.

p. 159-176

On the median-of-

k

version of Hoare’s selection algorithm

Grübel, Rudolf

p. 177-192

Communication complexity and lower bounds on multilective computations

Hromkovič, Juraj

p. 193-212