WorldCat Identities

Book, Ronald V.

Overview
Works: 49 works in 136 publications in 3 languages and 2,090 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, Other, Honoree, Contributor
Classifications: QA267, 511.3
Publication Timeline
.
Most widely held works by Ronald V Book
Currents in the theory of computing by Alfred V Aho( Book )

11 editions published in 1973 in English and held by 406 WorldCat member libraries worldwide

Formal language theory : perspectives and open problems by Ronald V Book( Book )

22 editions published between 1980 and 2014 in English and Undetermined and held by 395 WorldCat member libraries worldwide

Rewriting techniques and applications : 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989 : proceedings by Nachum Dershowitz( Book )

17 editions published in 1991 in English and held by 329 WorldCat member libraries worldwide

"This volume contains the proceedings of the Fourth International Conference on Rewriting Techniques and Applications (RTA-91), held in Como, Italy, April 10-12, 1991. The volume includes 40 papers on a wide variety of topics including: term rewriting systems, equational unification, algebraic rewriting, termination proofs, generalization problems, undecidable properties, parametrized specifications, normalizing systems, program transformation, query optimization, tree languages, graph languages, theorem proving systems, completion, graph rewriting systems, and open problems."--PUBLISHER'S WEBSITE
Studies in complexity theory by Ker-I Ko( Book )

13 editions published in 1986 in 3 languages and held by 320 WorldCat member libraries worldwide

String-rewriting systems by Ronald V Book( Book )

13 editions published between 1993 and 2012 in English and Undetermined and held by 268 WorldCat member libraries worldwide

The book represents an attempt by the authors to gather together the most fundamental results on string-rewriting systems. The goal is to explain these results in such a way that they can be understood and used in studies relating to more general rewriting, automated deduction, and algorithmic problems of algebraic structures. The authors have concentrated on presenting basic material that ought to be a prerequisite for understanding more specialized material. The monograph opens with the preliminaries of string-rewriting systems followed by length as the basis for reduction. Monadic string-rewriting systems is covered as well as length-reducing non-monadic string-writing systems. The book closes with the subjects of algebraic protocols and algebraic properties. When the reader has mastered the material in the core of the book (Chapters 1-4), then that person should be equipped to explore the ever-growing body of literature in the field of string-rewriting systems. Both authors have been active in the field of string-rewriting systems and have lectured on the subject in several universities. Lecture notes have been produced and distributed. This monograph is a result of revising and rewriting those notes. This monograph is written for independent study by researchers in theoretical computer science or in the foundation of artificial intelligence. This book is not intended as a textbook, but it certainly could be used as a textbook in computer science. It could be used for a course entitled "Rewriting Systems," or "String Rewriting," or "Foundations of Artificial Intelligence."
Advances in algorithms, languages, and complexity by Ding-Zu Du( Book )

7 editions published in 1997 in English and held by 89 WorldCat member libraries worldwide

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
Grammars with time functions by Ronald V Book( Book )

6 editions published in 1969 in English and held by 12 WorldCat member libraries worldwide

The subject of this paper is the study of formal grammars and of formal languages from the viewpoint of time-bounded grammars. The principal results focus on properties similar to those of families of languages defined by time-bounded nondeterministic Turing machines. Chapter 1 contains an overview of the results of this paper and a summary of basic ideas of automata theory and mathematical linguistics used here. In Chapter 2, basic properties of time-bounded grammars and languages generated by time-bounded grammars are investigated. Chapter 3 establishes the positive closure and containment properties of families of languages defined by grammars whose time functions are bounded by bounding functions. Nonclosure, undecidability, and hierarchy results are established in Chapter 4. (Author)
Descriptional complexity : 03.05. - 07.05.93 (9318); [report on Dagstuhl Seminar on Descriptional Complexity]( Book )

3 editions published in 1993 in English and German and held by 5 WorldCat member libraries worldwide

14th annual symposium on switching and automata theory, Oct. 15-17, 1973( Book )

1 edition published in 1973 in English and held by 5 WorldCat member libraries worldwide

On complexity classes and algorithmically random languages by Ronald V Book( Book )

3 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide

Abstract: "Every class C of languages satisfying a simple topological condition is shown to have probability one if and only if it contains some language that is algorithmically random in the sense of Martin-Löf. This result is used to derive separation properties of algorithmically random oracles and to give characterizations of the complexity classes P, BPP, and AM in terms of reducibility to such oracles."
Designing environments for constructive learning by Thomas M Duffy( Book )

1 edition published in 2012 in English and held by 3 WorldCat member libraries worldwide

This book focuses on constructivist pedagogy and the implications of that pedagogy for the principles and strategies of instructional design and for the use of technology in instruction. A constructivist pedagogy emphasizes the "situatedness" of learning. There is always a reason for learning; learning is a tool for accomplishing something else. Our understanding of a concept is based on the context in which it is experienced. Most importantly, that context involves the larger framework orpurpose for engaging in a task. In the first half of this book the authors describe constructivist learning environments and the particular theoretical framework in which they are embedded. The second half of the book focuses on instructional design principles to bederived from constructivism, the implications for the practice of instructional design, including principles for design, and the practical issues of implementing constructivist learning environments
Integrating advanced technology into technology education by Ronald V Book( Book )

1 edition published in 2012 in English and held by 3 WorldCat member libraries worldwide

Additional queries to random and pseudorandom oracles by Ronald V Book( Book )

2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide

Abstract: "Intuitively, a set A has the additional query (AQ) property if more problems are feasibly solvable with f(n) [plus] 1 queries to A than with f(n) queries to A. This property is formalized and investigated quantitatively with respect to two parameters: the intrinsic randomness of the oracle set A and the computational resources of the machines that query A. It is shown that (i) with probability one, a randomly selected set has a very strong (computationally unrestricted) form of the AQ property, and (ii) every pspace-random set has a polynomially restricted form of the AQ property."
Structural Properties of Grammars and Languages( Book )

1 edition published in 1970 in English and held by 2 WorldCat member libraries worldwide

The report is comprised of a statement of objectives; brief summary of results; and a listing of scientific reports, working papers, and publications
Designing computer-based learning materials by Ronald V Book( Book )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Knowledge, data and computer-assisted decisions by Ronald V Book( Book )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Automating instructional design, development, and delivery by Ronald V Book( Book )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Cognitive tools for learning by Ronald V Book( Book )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Intelligent learning environments and knowledge acquisition in physics by Ronald V Book( Book )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.63 (from 0.56 for Currents i ... to 0.90 for Structural ...)

Rewriting techniques and applications : 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989 : proceedings
Alternative Names
Book, Ronald V.

Book, Ronald Vernon 1937-1997

Ronald Book

Ronald V. Book Amerikaans wiskundige

Ronald V. Book amerikansk matematikar

Ronald V. Book amerikansk matematiker

Ronald V. Book US-amerikanischer Informatiker

Languages
English (100)

German (1)

Italian (1)

Covers
String-rewriting systemsAdvances in algorithms, languages, and complexity