A Basis for Theoretical Computer Science by M.A. Arbib, A.J. Kfoury, R.N. Moll.
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 machin...
Saved in:
Main Authors:  , , 

Corporate Author:  
Format:  eBook 
Language:  English 
Published: 
New York, NY :
Springer New York : Imprint: Springer,
1981.

Edition:  1st ed. 1981. 
Series:  The AKM Series in Theoretical Computer Science
Springer eBook Collection. 
Subjects:  
Online Access:  Click to view ebook 
Holy Cross Note:  Loaded electronically. Electronic access restricted to members of the Holy Cross Community. 
LEADER  05001nam a22006135i 4500  

001  b3212690  
003  MWH  
005  20191029053007.0  
007  cr nn 008mamaa  
008  121227s1981 xxu s  0eng d  
020  a 9781461394556  
024  7  a 10.1007/9781461394556 2 doi  
035  a (DEHe213)9781461394556  
050  4  a EBook  
072  7  a UY 2 bicssc  
072  7  a COM014000 2 bisacsh  
072  7  a UY 2 thema  
072  7  a UYA 2 thema  
100  1  a Arbib, M.A. e author. 4 aut 4 http://id.loc.gov/vocabulary/relators/aut  
245  1  2  a A Basis for Theoretical Computer Science h [electronic resource] / c by M.A. Arbib, A.J. Kfoury, R.N. Moll. 
250  a 1st ed. 1981.  
264  1  a New York, NY : b Springer New York : b Imprint: Springer, c 1981.  
300  a VIII, 220 p. b online resource.  
336  a text b txt 2 rdacontent  
337  a computer b c 2 rdamedia  
338  a online resource b cr 2 rdacarrier  
347  a text file b PDF 2 rda  
490  1  a The AKM Series in Theoretical Computer Science  
490  1  a Springer eBook Collection  
505  0  a 1 Sets, Maps, and Relations  1.1 Sets  1.2 Exponents and Series  1.3 Maps and Relations  2 Induction, Strings, and Languages  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 ContextFree Grammars  2.5 Processing Lists  3 Counting, Recurrences, and Trees  3.1 Some Counting Principles  3.2 Trees and Recurrences  3.3 An Example of Algorithm Analysis  4 Switching Circuits, Proofs, and Logic  4.1 Truth Tables and Switching Circuits  4.2 Proving Theorems  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  6 Graphs, Matrices, and Machines  6.1 An Invitation to Graph Theory  6.2 Graphs and Matrices  6.3 FiniteState Acceptors and Their Graphs  Author Index  Notation Index.  
520  a 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.  
590  a Loaded electronically.  
590  a Electronic access restricted to members of the Holy Cross Community.  
650  0  a Computers.  
650  0  a Mathematical logic.  
650  0  a Combinatorics.  
690  a Electronic resources (Ebooks)  
700  1  a Kfoury, A.J. e author. 4 aut 4 http://id.loc.gov/vocabulary/relators/aut  
700  1  a Moll, R.N. e author. 4 aut 4 http://id.loc.gov/vocabulary/relators/aut  
710  2  a SpringerLink (Online service)  
773  0  t Springer eBooks  
830  0  a The AKM Series in Theoretical Computer Science  
830  0  a Springer eBook Collection.  
856  4  0  u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/9781461394556 3 Click to view ebook 
907  a .b32126906 b 041822 c 022620  
998  a he b 022620 c m d @ e  f eng g xxu h 2 i 1  
912  a ZDB2SCS  
912  a ZDB2BAE  
950  a Computer Science (Springer11645)  
902  a springer purchased ebooks  
903  a SEBCOLL  
945  f   g 1 h 0 j   k   l he o  p $0.00 q  r  s b t 38 u 0 v 0 w 0 x 0 y .i21258557 z 022620  
999  f  f  i f22df1d991325bb991fa26619d7ea40c s 555d64ca1b8255fd8d69d1e1f5cbbaa3 
952  f  f  p Online a College of the Holy Cross b Main Campus c EResources d Eresources e EBook h Library of Congress classification i Elec File n 1 