Theoretical Informatics and Applications

Informatique théorique et applications

ITA, Vol. 33, N^o 2, 1999

p 103: On the complexity of the hidden weighted bit function for various BDD models
B. Bollig, M. Löbbing, M. Sauerhoff and I. Wegener
Abstract | PDF file (342 Kb)
p 117: Undecidability of the equivalence of finite substitutions on regular language
V. Halava and T. Harju
Abstract | PDF file (292 Kb)
p 125: On sequences defined by D0L power series
J. Honkala
Abstract | PDF file (276 Kb)
p 133: Construction of a deterministic $\omega$ -automaton using derivatives
R.R. Redziejowski
Abstract | PDF file (384 Kb)
p 159: Immunity and simplicity for exact counting and other counting classes
J. Rothe
Abstract | PDF file (451 Kb)
p 177: On the median-of-K version of Hoare's selection algorithm
R. Grübel
Abstract | PDF file (369 Kb)
p 193: Communication complexity and lower bounds on multilective computations
J. Hromkovic
Abstract | PDF file (440 Kb)