A basis for theoretical computer science

by Michael A. Arbib

Other authorsA. J. Kfoury (Author), Robert N. Moll (Author)
Hardcover, 1981

Status

Available

Call number

001.64 19

Library's review

Indeholder "Chapter 1. Sets, Maps, and Relations", "1.1 Sets", "1.2 Exponents and Series", "1.3 Maps and Relations", "Chapter 2. Induction, Strings, and Language", "2.1 Induction on the Natural Numbers", "2.2 The Strings Over an Arbitrary Set", "2.3 Languages and Automata: A First Look", "2.4
Show More
Context-Free Grammars", "2.5 Processing Lists", "Chapter 3. Counting, Recurrences, and Trees", "3.1 Some Counting Principles", "3.2 Trees and Recurrences", "3.3 An Example of Algorithm Analysis", "Chapter 4. Switching Circuits, Proofs, and Logic", "4.1 Truth Tables and Switching Circuits", "4.2 Proving Theorems", "Chapter 5. Binary Relations, Lattices, and Infinity", "5.1 Equivalence Relations and Partial Orders", "5.2 Lattices and Boolean Algebras", "5.3 An Introduction to Infinity", "5.4 Another Look at Trees", "Chapter 6. Graphs, Matrices, and Machines", "6.1 An Invitation to Graph Theory", "6.2 Graphs and Matrices", "6.3 Finite-State Acceptors and Their Graphs", "Author index", "Notation index", "Subject index".

Udmærket introduktion til datalogiens teoretiske aspekte
Show Less

Publication

New York: Springer-Verlag, c1981. viii, 220 p. : ill. ; 24 cm.

Description

Computer science seeks to provide a scientific basis for the study of inform a­ tion processing, the solution of problems by algorithms, and the design and programming of computers. The last forty years have seen increasing sophistication in the science, in the microelectronics which has made machines of staggering complexity economically feasible, in the advances in programming methodology which allow immense programs to be designed with increasing speed and reduced error, and in the development of mathematical techniques to allow the rigorous specification of program, process, and machine. The present volume is one of a series, The AKM Series in Theoretical Computer Science, designed to make key mathe­ matical developments in computer science readily accessible to under­ graduate and beginning graduate students. Specifically, this volume takes readers with little or no mathematical background beyond high school algebra, and gives them a taste of a number of topics in theoretical computer science while laying the mathematical foundation for the later, more detailed, study of such topics as formal language theory, computability theory, programming language semantics, and the study of program verification and correctness. Chapter 1 introduces the basic concepts of set theory, with special emphasis on functions and relations, using a simple algorithm to provide motivation. Chapter 2 presents the notion of inductive proof and gives the reader a good grasp on one of the most important notions of computer science: the recursive definition of functions and data structures.… (more)

Language

Original language

English

Physical description

viii, 220 p.; 24 cm

ISBN

0387905731 / 9780387905730

Local notes

Omslag: Ikke angivet
Omslaget viser en robothånd, der tegner en menneskehånd, der tegner robothånden. - En parafrase over M. C. Eschers tegning af et lignende motiv med to tegnede menneskehænder
M. C. Escher. Drawing Hands
Indskannet omslag - N650U - 150 dpi

Pages

viii; 220

Library's rating

Rating

½ (2 ratings; 3.5)

DDC/MDS

001.64 19
Page: 0.257 seconds