Discrete mathematical structures for computer science
By: Bernard Kolman, Robert C. Busby.
Contributors: Busby, Robert C.
Edition: 2nd ed.
Publisher: Prentice-Hall
Published: 1987
Place of publication: Englewood Cliffs, N.J
Language: eng
Number of pages: 464
Subjects: Computer science -- Mathematics
Notes: Includes bibliographies and index.
Table of contents: title: Preface
pagenum: xi; title: Fundamentals
pagenum: 1; label: 1.1
title: Sets and Subsets
pagenum: 1; label: 1.2
title: Sequences
pagenum: 7; label: 1.3
title: Operations on Sets
pagenum: 12; label: 1.4
title: Counting Sequences and Subsets (Permutations and Combinations)
pagenum: 25; label: 1.5
title: Algorithms and Pseudocode
pagenum: 33; label: 1.6
title: Induction and Recursion
pagenum: 47; label: 1.7
title: Division in the Integers
pagenum: 58; label: 1.8
title: Matrices
pagenum: 70; label: 2
title: Relations and Digraphs
pagenum: 85; label: 2.1
title: Product Sets and Partitions
pagenum: 85; label: 2.2
title: Relations and Digraphs
pagenum: 90; label: 2.3
title: Paths in Relations and Digraphs
pagenum: 101; label: 2.4
title: Properties of Relations
pagenum: 109; label: 2.5
title: Equivalence Relations
pagenum: 116; label: 2.6
title: Computer Representation of Relations and Digraphs
pagenum: 122; label: 2.7
title: Manipulation of Relations
pagenum: 131; label: 2.8
title: Transitive Closure and Warshall's Algorithm
pagenum: 144; label: 3
title: Functions
pagenum: 154; label: 3.1
title: Functions
pagenum: 154; label: 3.2
title: The Pigeonhole Principle
pagenum: 165; label: 3.3
title: Permutations
pagenum: 170; label: 4
title: Order Relations and Structures
pagenum: 181; label: 4.1
title: Partially Ordered Sets (Posets)
pagenum: 181; label: 4.2
title: Extremal Elements of Partially Ordered Sets
pagenum: 195; label: 4.3
title: Lattices
pagenum: 202; label: 4.4
title: Finite Boolean Algebras
pagenum: 215; label: 4.5
title: Functions on Boolean Algebras (Circuit Requirements)
pagenum: 223; label: 4.6
title: Expressing Boolean Functions as Boolean Polynomials (Circuit Design)
pagenum: 227; label: 5
title: Trees and Languages
pagenum: 241; label: 5.1
title: Trees
pagenum: 241; label: 5.2
title: Labeled Trees
pagenum: 246; label: 5.3
title: Languages
pagenum: 253; label: 5.4
title: Representations of Special Grammars and Languages
pagenum: 263; label: 5.5
title: Tree Searching
pagenum: 275; label: 5.6
title: Undirected Trees
pagenum: 288; label: 6
title: Semigroups and Groups
pagenum: 301; label: 6.1
title: Binary Operations
pagenum: 301; label: 6.2
title: Semigroups
pagenum: 306; label: 6.3
title: Products and Quotients of Semigroups
pagenum: 316; label: 6.4
title: Groups
pagenum: 324; label: 6.5
title: Products and Quotients of Groups
pagenum: 338; label: 7
title: Finite-State Machines and Languages
pagenum: 347; label: 7.1
title: Finite-State Machines
pagenum: 347; label: 7.2
title: Semigroups, Machines, and Languages
pagenum: 354; label: 7.3
title: Machines and Regular Languages
pagenum: 360; label: 7.4
title: Simplification of Machines
pagenum: 368; label: 8
title: Groups and Coding
pagenum: 375; label: 8.1
title: Coding of Binary Information and Error Detection
pagenum: 375; label: 8.2
title: Decoding and Error Correction
pagenum: 389; label: Appendix A
title: Logic
pagenum: 402; label: Appendix B
title: Elements of Probability
pagenum: 418; title: Answers to Odd-Numbered Exercises
pagenum: 434; title: Index
pagenum: 459