Book, Ronald V.
Overview
Works:  62 works in 157 publications in 2 languages and 2,193 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other, Honoree, Contributor 
Classifications:  QA267, 005.131 
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 401 WorldCat member libraries worldwide
11 editions published in 1973 in English and held by 401 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 391 WorldCat member libraries worldwide
22 editions published between 1980 and 2014 in English and Undetermined and held by 391 WorldCat member libraries worldwide
Rewriting techniques and applications : 3rd International Conference, RTA89, Chapel Hill, North Carolina, USA, April 35,
1989 : proceedings by
Nachum Dershowitz(
Book
)
17 editions published in 1991 in English and held by 325 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
17 editions published in 1991 in English and held by 325 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
)
13 editions published in 1986 in 3 languages and held by 314 WorldCat member libraries worldwide
13 editions published in 1986 in 3 languages and held by 314 WorldCat member libraries worldwide
Stringrewriting systems by
Ronald V Book(
Book
)
13 editions published between 1993 and 2012 in English and Undetermined and held by 265 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."
13 editions published between 1993 and 2012 in English and Undetermined and held by 265 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
Dingzhu Du(
Book
)
6 editions published in 1997 in English and held by 87 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 coauthor 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
6 editions published in 1997 in English and held by 87 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 coauthor 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
)
7 editions published in 1969 in English and held by 13 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)
7 editions published in 1969 in English and held by 13 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)
14th annual symposium on switching and automata theory, Oct. 1517, 1973 by
Symposium on Switching and Automata Theory(
Book
)
1 edition published in 1973 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1973 in English and held by 5 WorldCat member libraries worldwide
Logic of domains by
GuoQiang Zhang(
)
1 edition published in 1991 in English and held by 0 WorldCat member libraries worldwide
Special kinds of open sets called stable neighborhoods are introduced and shown to determine stable functions in a similar sense to that in which Scottopen sets determine continuous functions. Properties and constructions of stable neighborhoods on various categories of dIdomains are investigated. Logical frameworks for Girard's coherent spaces and Berry's dIdomains are given in which assertions are interpreted as stable neighborhoods. Various soundness, completeness, and expressiveness results are provided."
1 edition published in 1991 in English and held by 0 WorldCat member libraries worldwide
Special kinds of open sets called stable neighborhoods are introduced and shown to determine stable functions in a similar sense to that in which Scottopen sets determine continuous functions. Properties and constructions of stable neighborhoods on various categories of dIdomains are investigated. Logical frameworks for Girard's coherent spaces and Berry's dIdomains are given in which assertions are interpreted as stable neighborhoods. Various soundness, completeness, and expressiveness results are provided."
Algorithms for random generation and counting : a Markov chain approach by
Alistair Sinclair(
)
1 edition published in 1993 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1993 in English and held by 0 WorldCat member libraries worldwide
The combinatory programme by
Erwin Engeler(
)
1 edition published in 1995 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 0 WorldCat member libraries worldwide
Neural networks and analog computation : beyond the Turing limit by
Hava T Siegelmann(
)
1 edition published in 1999 in English and held by 0 WorldCat member libraries worldwide
The theoretical foundations of Neural Networks and Analog Computation conceptualize neural networks as a particular type of computer consisting of multiple assemblies of basic processors interconnected in an intricate structure. Examining these networks under various resource constraints reveals a continuum of computational devices, several of which coincide with wellknown classical models. What emerges is a ChurchTuringlike thesis, applied to the field of analog computation, which features the neural network model in place of the digital Turing machine. This new concept can serve as a point of departure for the development of alternative, supraTuring, computational theories. On a mathematical level, the treatment of neural computations enriches the theory of computation but also explicated the computational complexity associated with biological networks, adaptive engineering tools, and related models from the fields of control theory and nonlinear dynamics. The topics covered in this work will appeal to a wide readership from a variety of disciplines. Special care has been taken to explain the theory clearly and concisely. The first chapter review s the fundamental terms of modern computational theory from the point of view of neural networks and serves as a reference for the remainder of the book. Each of the subsequent chapters opens with introductory material and proceeds to explain the chapter's connection to the development of the theory. Thereafter, the concept is defined in mathematical terms. Although the notion of a neural network essentially arises from biology, many engineering applications have been found through highly idealized and simplified models of neuron behavior. Particular areas of application have been as diverse as explosives detection in airport security, signature verification, financial and medical times series prediction, vision, speech processing, robotics, nonlinear control, and signal processing. The focus in all of these models is entirely on the behavior of networks as computer. The material in this book will be of interest to researchers in a variety of engineering and applied sciences disciplines. In addition, the work may provide the base of a graduatelevel seminar in neural networks for computer science students
1 edition published in 1999 in English and held by 0 WorldCat member libraries worldwide
The theoretical foundations of Neural Networks and Analog Computation conceptualize neural networks as a particular type of computer consisting of multiple assemblies of basic processors interconnected in an intricate structure. Examining these networks under various resource constraints reveals a continuum of computational devices, several of which coincide with wellknown classical models. What emerges is a ChurchTuringlike thesis, applied to the field of analog computation, which features the neural network model in place of the digital Turing machine. This new concept can serve as a point of departure for the development of alternative, supraTuring, computational theories. On a mathematical level, the treatment of neural computations enriches the theory of computation but also explicated the computational complexity associated with biological networks, adaptive engineering tools, and related models from the fields of control theory and nonlinear dynamics. The topics covered in this work will appeal to a wide readership from a variety of disciplines. Special care has been taken to explain the theory clearly and concisely. The first chapter review s the fundamental terms of modern computational theory from the point of view of neural networks and serves as a reference for the remainder of the book. Each of the subsequent chapters opens with introductory material and proceeds to explain the chapter's connection to the development of the theory. Thereafter, the concept is defined in mathematical terms. Although the notion of a neural network essentially arises from biology, many engineering applications have been found through highly idealized and simplified models of neuron behavior. Particular areas of application have been as diverse as explosives detection in airport security, signature verification, financial and medical times series prediction, vision, speech processing, robotics, nonlinear control, and signal processing. The focus in all of these models is entirely on the behavior of networks as computer. The material in this book will be of interest to researchers in a variety of engineering and applied sciences disciplines. In addition, the work may provide the base of a graduatelevel seminar in neural networks for computer science students
Subrecursive programming systems : complexity & succinctness by
James S Royer(
)
1 edition published in 1994 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 0 WorldCat member libraries worldwide
Solving higherorder equations : from logic to programming by
Christian Prehofer(
)
1 edition published in 1998 in English and held by 0 WorldCat member libraries worldwide
Abstract: "Higherorder constructs provide the necessary level of abstraction for concise and natural formulations in many areas of computer science. We present constructive methods for higherorder equational reasoning with applications ranging from theorem proving to novel programming concepts. A major problem of higherorder programming is the undecidability of higherorder unification. In the first part, we develop several classes with decidable secondorder unification. As the main result, we show that the unification of a linear higherorder pattern s with an arbitrary secondorder term that shares no variables with s is decidable and finitely solvable. This is the unification needed for secondorder functionallogic programming. The second main contribution is a framework for solving higherorder equational problems by narrowing. In the firstorder case, narrowing is the underlying computation rule for the integration of logic programming and functional programming. We argue that there are some principal problems with lifting the standard notion of firstorder narrowing to the higherorder case. In contrast, the alternative approach, lazy narrowing, solves goals in a topdown manner and can be adapted to the higherorder case. Several refinements that utilize the deterministic evaluation of functional programs, such as normalization, are developed for this approach. We further introduce a restricted class of equational goals that suffices for programming applications. This class, called Simple Systems, enjoys decidable unification in the second order case, using the results of the first part. It facilitates several other optimizations, e.g. recognizing solved system is simple. Integrating these refinements leads to a new narrowing strategy where intermediate goals can safely be delayed and are only solved when needed. This work forms a new basis for truly higherorder functionallogic programming that is oriented more towards higherorder functional programs than to horn clauses as in logic programming. We argue that many techniques of first order (functional )logic programming can be modeled more directly in our higherorder functional approach."
1 edition published in 1998 in English and held by 0 WorldCat member libraries worldwide
Abstract: "Higherorder constructs provide the necessary level of abstraction for concise and natural formulations in many areas of computer science. We present constructive methods for higherorder equational reasoning with applications ranging from theorem proving to novel programming concepts. A major problem of higherorder programming is the undecidability of higherorder unification. In the first part, we develop several classes with decidable secondorder unification. As the main result, we show that the unification of a linear higherorder pattern s with an arbitrary secondorder term that shares no variables with s is decidable and finitely solvable. This is the unification needed for secondorder functionallogic programming. The second main contribution is a framework for solving higherorder equational problems by narrowing. In the firstorder case, narrowing is the underlying computation rule for the integration of logic programming and functional programming. We argue that there are some principal problems with lifting the standard notion of firstorder narrowing to the higherorder case. In contrast, the alternative approach, lazy narrowing, solves goals in a topdown manner and can be adapted to the higherorder case. Several refinements that utilize the deterministic evaluation of functional programs, such as normalization, are developed for this approach. We further introduce a restricted class of equational goals that suffices for programming applications. This class, called Simple Systems, enjoys decidable unification in the second order case, using the results of the first part. It facilitates several other optimizations, e.g. recognizing solved system is simple. Integrating these refinements leads to a new narrowing strategy where intermediate goals can safely be delayed and are only solved when needed. This work forms a new basis for truly higherorder functionallogic programming that is oriented more towards higherorder functional programs than to horn clauses as in logic programming. We argue that many techniques of first order (functional )logic programming can be modeled more directly in our higherorder functional approach."
Semantics of type theory : correctness, completeness, and independence results by
Thomas Streicher(
)
1 edition published in 1991 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 0 WorldCat member libraries worldwide
Categorical combinators, sequential algorithms, and functional programming by
P.L Curien(
)
1 edition published in 1993 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1993 in English and held by 0 WorldCat member libraries worldwide
Algollike Languages by
Ronald V Book(
)
1 edition published in 1996 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1996 in English and held by 0 WorldCat member libraries worldwide
Comparative metric semantics of programming languages : nondeterminism and recursion by
Franck van Breugel(
)
1 edition published in 1996 in English and held by 0 WorldCat member libraries worldwide
During the last three decades several different styles of semantics for program ming languages have been developed. This book compares two of them: the operational and the denotational approach. On the basis of several exam ples we show how to define operational and denotational semantic models for programming languages. Furthermore, we introduce a general technique for comparing various semantic models for a given language. We focus on different degrees of nondeterminism in programming lan guages. Nondeterminism arises naturally in concurrent languages. It is also an important concept in specification languages. In the examples discussed, the degree of non determinism ranges from a choice between two alternatives to a choice between a collection of alternatives indexed by a closed interval of the real numbers. The former arises in a language with nondeterministic choices. A real time language with dense choices gives rise to the latter. We also consider the nondeterministic random assignment and parallel composition, both couched in a simple language. Besides non determinism our four example languages contain some form of recursion, a key ingredient of programming languages
1 edition published in 1996 in English and held by 0 WorldCat member libraries worldwide
During the last three decades several different styles of semantics for program ming languages have been developed. This book compares two of them: the operational and the denotational approach. On the basis of several exam ples we show how to define operational and denotational semantic models for programming languages. Furthermore, we introduce a general technique for comparing various semantic models for a given language. We focus on different degrees of nondeterminism in programming lan guages. Nondeterminism arises naturally in concurrent languages. It is also an important concept in specification languages. In the examples discussed, the degree of non determinism ranges from a choice between two alternatives to a choice between a collection of alternatives indexed by a closed interval of the real numbers. The former arises in a language with nondeterministic choices. A real time language with dense choices gives rise to the latter. We also consider the nondeterministic random assignment and parallel composition, both couched in a simple language. Besides non determinism our four example languages contain some form of recursion, a key ingredient of programming languages
Finite automata, formal logic, and circuit complexity by
Howard Straubing(
)
1 edition published in 1994 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 0 WorldCat member libraries worldwide
The graph isomorphism problem : its structural complexity by
Johannes Köbler(
)
1 edition published in 1993 in English and held by 0 WorldCat member libraries worldwide
"The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable.Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically selfcontained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory."Book cover
1 edition published in 1993 in English and held by 0 WorldCat member libraries worldwide
"The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable.Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically selfcontained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory."Book cover
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Aho, Alfred V. Author Editor
 Otto, Friedrich
 Ko, KerI Author Editor
 Du, Dingzhu Editor
 RTA (4, 1991, Como)
 Symposium on Formal Language Theory. <1979, Santa Barbara, Calif.>.
 MacAloon, Kenneth
 Mahaney, Stephen R.
 Köbler, Johannes Author
 Prehofer, Christian Author
Useful Links
Associated Subjects
AlgebraData processing Algorithms Artificial intelligence Combinatorial analysis Combinatorial set theory Combinatory logic Computational complexity Computer algorithms Computer logic Computer programming Computer science Computer scienceMathematics Computer software Declarative programming Engineering mathematics Formal languages Functional programming (Computer science) Grammar, Comparative and generalSyntax Grammar, Comparative and generalTense Graph theoryData processing Group theory Information theory Isomorphisms (Mathematics) Logic, Symbolic and mathematical Logic design Logic programming Machine theory Markov processes Mathematical linguistics Mathematics Neural networks (Computer science) Programming (Mathematics) Programming languages (Electronic computers) Programming languages (Electronic computers)Semantics Reasoning Rewriting systems (Computer science) Robots Sequential machine theory Software engineering Switching theory Turing machines Type theory
Alternative Names
Book, Ronald V.
Book, Ronald Vernon 19371997
Ronald Book
Ronald V. Book Amerikaans wiskundige
Ronald V. Book amerikansk matematikar
Ronald V. Book amerikansk matematiker
Ronald V. Book matemàtic estatunidenc
Ronald V. Book matemático estadounidense
Ronald V. Book matematico statunitense
Ronald V. Book mathématicien américain
Ronald V. Book USamerikanischer Informatiker
Languages
Covers