Journal: Theory Comput. Syst.

Volume 27, Issue 4

285 -- 346Helmut Seidl. Equivalence of Finite-Valued Tree Transducers Is Decidable
347 -- 356Montserrat Hermo, Elvira Mayordomo. A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity
357 -- 363Alain Hertz. A New Polynomial-Time Algorithm for the Maximum Weighted (/chi(G) - 1)-Coloring Problem in Comparability Graphs
365 -- 376Ming Li, Paul M. B. Vitányi. Statistical Properties of Finite Sequences with High Kolmogorov Complexity