Advances in Algorithms, Languages, and Complexity

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

Full description

Bibliographic Details
Other Authors: Ding-Zhu Du (Editor), Ker-I Ko (Editor)
Format: eBook
Language:English
Published: New York, NY Springer US 1997, 1997
Edition:1st ed. 1997
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02945nmm a2200313 u 4500
001 EB000622362
003 EBX01000000000000000475444
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9781461333944 
100 1 |a Ding-Zhu Du  |e [editor] 
245 0 0 |a Advances in Algorithms, Languages, and Complexity  |h Elektronische Ressource  |c edited by Ding-Zhu Du, Ker-I Ko 
250 |a 1st ed. 1997 
260 |a New York, NY  |b Springer US  |c 1997, 1997 
300 |a XXXIV, 396 p  |b online resource 
505 0 |a 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 
653 |a Group Theory and Generalizations 
653 |a Computer science 
653 |a Group theory 
653 |a Algorithms 
653 |a Theory of Computation 
700 1 |a Ker-I Ko  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
028 5 0 |a 10.1007/978-1-4613-3394-4 
856 4 0 |u https://doi.org/10.1007/978-1-4613-3394-4?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 518.1 
520 |a 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