Overview

This book contains a collection of survey papers in the areas of algorithms, lan­ guages and complexity, the three areas in which Professor Ronald V. Book has made significant contributions. As a fonner student and a co-author who have been influenced by him directly, we would like to dedicate this book to Professor Ronald V. Book to honor and celebrate his sixtieth birthday. Professor Book initiated his brilliant academic career in 1958, graduating from Grinnell College with a Bachelor of Arts degree. He obtained a Master of Arts in Teaching degree in 1960 and a Master of Arts degree in 1964 both from Wesleyan University, and a Doctor of Philosophy degree from Harvard University in 1969, under the guidance of Professor Sheila A. Greibach. Professor Book's research in discrete mathematics and theoretical com­ puter science is reflected in more than 150 scientific publications. These works have made a strong impact on the development of several areas of theoretical computer science. A more detailed summary of his scientific research appears in this volume separately.

Full Product Details

Author:   Ding-Zhu Du ,  Ker-I Ko
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1997
Dimensions:   Width: 16.00cm , Height: 2.30cm , Length: 24.00cm
Weight:   0.692kg
ISBN:  

9781461333968

ISBN 10:   1461333962
Pages:   396
Publication Date:   12 October 2011
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions