Book, Ronald V.
Overview
Works:  55 works in 125 publications in 2 languages and 1,937 library holdings 

Genres:  Conference proceedings 
Roles:  Author, Editor, Honoree 
Classifications:  QA267, 001.64 
Publication Timeline
.
Most widely held works by
Ronald V Book
Currents in the theory of computing by
Alfred V Aho(
Book
)
6 editions published in 1973 in English and held by 404 WorldCat member libraries worldwide
6 editions published in 1973 in English and held by 404 WorldCat member libraries worldwide
Formal language theory : perspectives and open problems by
Ronald V Book(
Book
)
18 editions published between 1980 and 2014 in English and Undetermined and held by 384 WorldCat member libraries worldwide
18 editions published between 1980 and 2014 in English and Undetermined and held by 384 WorldCat member libraries worldwide
Rewriting techniques and applications : 4th International Conference, RTA91, Como, Italy, April 1012, 1991 : proceedings by
Ronald V Book(
Book
)
15 editions published in 1991 in English and held by 354 WorldCat member libraries worldwide
"This volume contains the proceedings of the Fourth International Conference on Rewriting Techniques and Applications (RTA91), held in Como, Italy, April 1012, 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
15 editions published in 1991 in English and held by 354 WorldCat member libraries worldwide
"This volume contains the proceedings of the Fourth International Conference on Rewriting Techniques and Applications (RTA91), held in Como, Italy, April 1012, 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
KerI Ko(
Book
)
11 editions published in 1986 in 3 languages and held by 318 WorldCat member libraries worldwide
11 editions published in 1986 in 3 languages and held by 318 WorldCat member libraries worldwide
Stringrewriting systems by
Ronald V Book(
Book
)
11 editions published between 1993 and 2012 in English and Undetermined and held by 286 WorldCat member libraries worldwide
The book represents an attempt by the authors to gather together the most fundamental results on stringrewriting 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 stringrewriting systems followed by length as the basis for reduction. Monadic stringrewriting systems is covered as well as lengthreducing nonmonadic stringwriting 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 14), then that person should be equipped to explore the evergrowing body of literature in the field of stringrewriting systems. Both authors have been active in the field of stringrewriting 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."
11 editions published between 1993 and 2012 in English and Undetermined and held by 286 WorldCat member libraries worldwide
The book represents an attempt by the authors to gather together the most fundamental results on stringrewriting 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 stringrewriting systems followed by length as the basis for reduction. Monadic stringrewriting systems is covered as well as lengthreducing nonmonadic stringwriting 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 14), then that person should be equipped to explore the evergrowing body of literature in the field of stringrewriting systems. Both authors have been active in the field of stringrewriting 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 DingZu Du(
Book
)
6 editions published in 1997 in English and held by 105 WorldCat member libraries worldwide
This book contains a collection of sixteen survey papers on recent developments in algorithms, formal languages, and computational complexity. These are the three areas in which Professor Ronald V. Book has made significant contributions, and the objective of the editors and the contributors is to honor Professor Book on his sixtieth birthday. Audience: Researchers and graduate students with interests in design and analysis of algorithms, in language theory, and in computational complexity
6 editions published in 1997 in English and held by 105 WorldCat member libraries worldwide
This book contains a collection of sixteen survey papers on recent developments in algorithms, formal languages, and computational complexity. These are the three areas in which Professor Ronald V. Book has made significant contributions, and the objective of the editors and the contributors is to honor Professor Book on his sixtieth birthday. Audience: Researchers and graduate students with interests in design and analysis of algorithms, in language theory, and in computational complexity
Grammars with time functions by
Ronald V Book(
Book
)
5 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 timebounded grammars. The principal results focus on properties similar to those of families of languages defined by timebounded 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 timebounded grammars and languages generated by timebounded 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)
5 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 timebounded grammars. The principal results focus on properties similar to those of families of languages defined by timebounded 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 timebounded grammars and languages generated by timebounded 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)
Formal language theory : perspectives and open problems : (symposium, Santa Barbara, Calif., December 1014, 1979) : (proceedings
of a conference)(
Book
)
1 edition published in 1980 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1980 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 MartinLö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."
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 MartinLö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."
14th annual symposium on switching and automata theory, Oct. 1517, 1973(
Book
)
1 edition published in 1973 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1973 in English and held by 4 WorldCat member libraries worldwide
Descriptional complexity : 03.05.  07.05.93 (9318); [report on Dagstuhl Seminar on Descriptional Complexity](
Book
)
2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide
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
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 pspacerandom set has a polynomially restricted form of the AQ property."
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 pspacerandom set has a polynomially restricted form of the AQ property."
Second generation expert systems by
Ronald V Book(
Book
)
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
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
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
Designing environments for constructive learning by
Thomas M Duffy(
Book
)
1 edition published in 2012 in English and held by 2 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
1 edition published in 2012 in English and held by 2 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
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
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
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
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
Knowledge, data and computerassisted decisions by
Ronald V Book(
Book
)
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
Designing computerbased learning materials by
Ronald V Book(
Book
)
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
AlgebraData processing Algorithms Artificial intelligence Computational complexity Computerassisted instruction Computer programming Computer science Computer software Constructivism (Education) Educational technology Formal languages Grammar, Comparative and generalSyntax Grammar, Comparative and generalTense Instructional systems Instructional systemsDesign Logic, Symbolic and mathematical Mathematical linguistics Measure theory Programming languages (Electronic computers) Rewriting systems (Computer science) Sequential machine theory Turing machines