Advances in Algorithms, Languages, and Complexity

ISBN-13: 9780792343967 / Angielski / Twarda / 1997 / 396 str.

Ding-Zhu Du; Du Ding-Zhu Du; Ko Ker-I Ko

Opis

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."

Spis treści

Foreword. A Summary of R.V. Book's Scientific Research. R.V. Book's Students and Postgraduate Research Fellows. List of R.V. Book's Publications. Theorem Proving in Hierarchical Clausal Specifications; J. Avenhaus, K. Madlener. Algorithms for Learning Finite Automata from Queries: A Unified View; J.L. Balcázar, et al. Coding Complexity: The Computational Complexity of Succinct Descriptions; J.L. Balcázar, et al. Homomorphic Representations of Certain Classes of Languages; F.J. Brandenburg. Block-Synchronization Context-Free Grammars; H. Jürgensen, K. Salomaa. High Sets for NP; J. Köbler, U. Schöning. Average-Case Analysis Using Kolmogorov Complexity; Ming Li, P. Vitányi. Genericity and Randomness over Feasible Probability Measures; A.K. Lorentz, J.H. Lutz. Book's Impact on the Theory of Thue Systems - Abstract; R. McNaughton. Sparse Hard Sets for P; D. van Melkebeek, M. Ogihara. A Survey of Continuous-Time Computation Theory; P. Orponen. Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey; I. Otto, Y. Kobayashi. Relaxed Balancing in Search Trees; E. Soisalon-Soininen, P. Widmayer. Measure One Results in Computational Complexity Theory; H. Vollmer, K.W. Wagner. Average-Case Intractable NP Problems; Jie Wang. Multichannel Lightwave Networks; Pengjun Wan, Feng Cao.