No label defined (Q3129783)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Avenhaus, J.; Madlener, K.}, Theorem proving in hierarchical clausal specifications, 1-51 [Zbl 0867.68096] \textit{Balcázar, José L.; Díaz, Josep; Gavaldà, Ricard; Watanabe, Osamu}, Algorithms for learning finite automata from queries: A unified view, 53-72 [Zbl 0874.68260] \textit{Balcázar, José L.; Gavaldà, Ricard; Watanabe, Osamu}, Coding complexity: The computational complexity of succinct descriptions, 73-91 [Zbl 0874.68149] \textit{Brandenburg, Franz J.}, Homomorphic representations of certain classes of languages, 93-110 [Zbl 0867.68072] \textit{Jürgensen, Helmut; Salomaa, Kai}, Block-synchronization context-free grammars, 111-137 [Zbl 0867.68077] \textit{Köbler, Johannes; Schöning, Uwe}, High sets for NP, 139-156 [Zbl 0876.68043] \textit{Li, Ming; Vitányi, Paul}, Average-case analysis using Kolmogorov complexity, 157-169 [Zbl 0867.68061] \textit{Lorentz, Amy K.; Lutz, Jack H.}, Genericity and randomness over feasible probability measures, 171-187 [Zbl 0867.68052] \textit{van Melkebeek, Dieter; Ogihara, Mitsunori}, Sparse hard sets for P, 191-208 [Zbl 0867.68053] \textit{Orponen, Pekka}, A survey of continuous-time computation theory, 209-224 [Zbl 0867.68047] \textit{Otto, F.; Kobayashi, Y.}, Properties of monoids that are presented by finite convergent string-rewriting systems. -- A survey, 225-266 [Zbl 0867.68065] \textit{Soisalon-Soininen, Eljas; Widmayer, Peter}, Relaxed balancing in search trees, 267-283 [Zbl 0874.68080] \textit{Vollmer, Heribert; Wagner, Klaus W.}, Measure one results in computational complexity theory, 285-312 [Zbl 0867.68054] \textit{Wang, Jie}, Average-case intractable NP problems, 313-378 [Zbl 0876.68055] List of R. V. Book's publications, xxiii-xxxiv [Zbl 0868.01005]