English Reprint Copyright 2001 by PEARSON EDUCATION ，NORTH ASIA LIMIED and HIGHEREDUCATION PRESSDiscrete Mathematical structure from prentice Halls edition of the workDiscrete Mathematical Structure， 4th edition by Bernard Kolman， Robert C， Busby， Sharon CutlerRoss Copyright20911996All Rights ReservedPublished by arrangement with Prentice Hall， Inc.， a Pwarson Education companyThis edition is authorized for sale only in the Peoples Republic of China （excluding the SpecialAdministrative Regions of Hong Kong nd Maeau）目錄1Fundamentals 12Logic463Counting 734 Relations and Digraphs 1035 Functions 1616 Order Relations and Structures 1917 Trees 2458 Topics in Graph Theory2809Semigroups and Groups 319l0 Languages and Finite-State Machines 357Appendix A： Algorithms and Pseudocode 425Appendix B： Experiments in Discrete Mathematics 438Answers to Odd-Numbered Exercises 455Answers to Chapter Self-Tests 489Index 502
作者簡介
暫缺《離散數(shù)學(xué)結(jié)構(gòu)（第4版 影印版）》作者簡介
圖書目錄
Preface 1 Fundamentals 1.1 Sets and Subsets 1.2 Operations on Sets 1.3 Sequences 1.4 Divison in the Integers 1.5 Matrices 1.6 Matematical Structures 2 Logic 2.1 Propositions and Logical operations 2.2 Conditional Statements 2.3 Methods of Proof 2.4 Mathematical Induction 3 Counting 3.1 Permutations 3.2 Combinations 3.3 Pigeonhole Principle 3.4 Elements of Probability 3.5 Recurrence Relations 4 Relations and Digraphs 4.1 Product Sets and Partitions 4.2 Relations and Digraphs 4.3 Paths in Relations and Digraphs 4.4 Properties of Relations 4.5 Equivalence Relations 4.6 Computer Rrpresentation of Relations and Digraphs 4.7 Operations on Relations 4.8 Transitive and Warshall’s Algorithm 5 Functions 5.1 Functions 5.2 Functions for Computer Science 5.3 Growth of Functions 5.4 Permutation Functions 6 Order Relations and Structures 6.1 Partially Ordered Sets 6.2 Extremal Elements of Partially Ordered Sets 6.3 Lattices 6.4 Finite Boolean algebras 6.5 Functions on Boolean Algebras 6.6 Circuit Designs 7 Trees 7.1 Trees 7.2 Labeled Trees 7.3 Tree Searching 7.4 Undirected Trees 7.5 Minimal Spanning Trees 8 Topics in Graph Theory 8.1 Graphs 8.2 Euler Paths and Circuits 8.3 Hamiltonian Paths and Circuits 8.4 Transport Networks 8.5 Matching Problems 8.6 Coloring Graphs 9 Semigroups and Groups 9.1 Binary Operations Revisited 9.2 Semigroups 9.3 Products and Quotients of Semigroups 9.4 Groups 9.5 Products and Quotients of Groups 10 Languages and Finite-State Machines 10.1 Languages 10.2 Rrpresentations of Special Grammars and Languages 10.3 Finite-State Machines 10.4 Semigroups，Machines，and Languages 10.5 Machines and Regulat Languages 10.6 Sunplification of Machines 11 Groups and Coding 11.1 Coding of Binary Information and Error Detection 11.2 Decoding and Error Correction Appendix A：Algorithms and Pseudocode Appendix B：Experiments in Discrete Mathematics Answers to Odd－Numbered Exercises Answers to Chapter Self-Tests Index
鄂公網(wǎng)安備 42010302001612號 