1. Equivalence of finite-valued tree transducers is decidable

   • H. Seidl

   OriginalPaper Pages: 285 - 346

2. A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity

   • Montserrat Hermo
   • Elvira Mayordomo

   OriginalPaper Pages: 347 - 356

3. A new polynomial-time algorithm for the maximum weighted (χ(G) — 1)-coloring problem in comparability graphs

   • A. Hertz

   OriginalPaper Pages: 357 - 363

4. Statistical properties of finite sequences with high Kolmogorov complexity

   • Ming Li
   • Paul M. B. Vitányi

   OriginalPaper Pages: 365 - 376