Table of Contents

Theorem Proving in Hierarchical Clausal Specifications.- Algorithms for Learning Finite Automata from Queries: A Unified View.- Coding Complexity: The Computational Complexity of Succinct Descriptions.- Homomorphic Representations of Certain Classes of Languages.- Block-Synchronization Context-Free Grammars.- High Sets for NP.- Average-Case Analysis Using Kolmogorov Complexity.- Genericity and Randomness over Feasible Probability Measures.- Book’s Impact on the Theory of Thue Systems — Abstract.- Sparse Hard Sets for P.- A Survey of Continuous-Time Computation Theory.- Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey.- Relaxed Balancing in Search Trees.- Measure One Results in Computational Complexity Theory.- Average-Case Intractable NP Problems.- Multichannel Lightwave Networks.

Promotional Information

Springer Book Archives