Discrete mathematical structures for computer science
By: Ronald E. Prather. --
Publisher: Houghton Mifflin
Published: 1976
Place of publication: Boston
Language: eng
Number of pages: 549
Subjects: Algebra, Abstract; Algorithms; Combinational analysis
Notes: Includes index.

6
Table of contents: title: Preface
pagenum: ix; title: Introduction
pagenum: xiii; label: Chapter 0
title: Preliminaries
pagenum: 1; label: 0.1
title: Sets and Subsets
pagenum: 2; label: 0.2
title: Algebra of Sets
pagenum: 7; label: 0.3
title: Relations and Functions
pagenum: 14; label: 0.4
title: Samples and Selections
pagenum: 23; label: 0.5
title: Equivalence Relations
pagenum: 28; label: 0.6
title: Algebra of Relations
pagenum: 33; label: 0.7
title: Properties of Functions
pagenum: 41; label: 0.8
title: Elementary Counting Techniques
pagenum: 50; label: 0.9
title: Countable Sets
pagenum: 59; label: 0.10
title: Theorems and Proofs
pagenum: 62; title: Suggested References
pagenum: 67; label: Chapter 1
title: Algebras and Algorithms
pagenum: 69; label: 1.1
title: Integers and Induction
pagenum: 70; label: 1.2
title: Algebras and Propositions
pagenum: 78; label: 1.3
title: Algebraic Expressions
pagenum: 86; label: 1.4
title: Effective Algebraic Structures
pagenum: 89; label: 1.5
title: Algebraic Flowchart Language
pagenum: 93; label: 1.6
title: Algorithmic Closure
pagenum: 99; label: 1.7
title: Syntax and Semantics
pagenum: 104; label: *1.8
title: Structured Algorithms
pagenum: 110; label: *1.9
title: Analysis of Algorithms
pagenum: 123; label: 1.10
title: Sequential Form
pagenum: 131; title: Suggested References
pagenum: 137; label: Chapter 2
title: Graphs and Digraphs
pagenum: 139; label: 2.1
title: Graphs and Subgraphs
pagenum: 140; label: 2.2
title: Paths and Circuits
pagenum: 149; label: 2.3
title: Circuit Rank
pagenum: 153; label: 2.4
title: Trees
pagenum: 162; label: 2.5
title: Planarity
pagenum: 170; label: 2.6
title: Isomorphism and Invariants
pagenum: 180; label: 2.7
title: Directed Graphs
pagenum: 191; label: 2.8
title: Reachability
pagenum: 202; label: *2.9
title: Path Problems
pagenum: 209; label: *2.10
title: Acyclic Digraphs
pagenum: 220; title: Suggested References
pagenum: 229; label: Chapter 3
title: Monoids and Machines
pagenum: 230; label: 3.1
title: Monoids and Submonoids
pagenum: 230; label: 3.2
title: Transformation Monoids
pagenum: 239; label: 3.3
title: Homomorphisms of Algebras
pagenum: 244; label: 3.4
title: Free Monoids
pagenum: 251; label: 3.5
title: Labeled Trees
pagenum: 255; label: 3.6
title: Searching and Sorting
pagenum: 263; label: 3.7
title: The Homomorphism Theorem
pagenum: 270; label: 3.8
title: Finite State Machines
pagenum: 276; label: *3.9
title: Minimization of Machines
pagenum: 288; label: *3.10
title: Decomposition of Machines
pagenum: 294; title: Suggested References
pagenum: 304; label: Chapter 4
title: Lattices and Boolean Algebras
pagenum: 305; label: 4.1
title: Posets
pagenum: 305; label: 4.2
title: Lattices
pagenum: 314; label: 4.3
title: Free Distributive Lattices
pagenum: 322; label: 4.4
title: Lattice of the n-Cube
pagenum: 332; label: 4.5
title: Boolean Algebras
pagenum: 338; label: 4.6
title: Free Boolean Algebras
pagenum: 342; label: 4.7
title: Interpretation and Canonical Forms
pagenum: 348; label: *4.8
title: The Minimization Problem
pagenum: 354; label: *4.9
title: The Quine-McCluskey Procedure
pagenum: 363; title: Suggested References
pagenum: 372; label: Chapter 5
title: Groups and Combinatorics
pagenum: 373; label: 5.1
title: Groups and Subgroups
pagenum: 375; label: 5.2
title: Permutation Groups
pagenum: 382; label: 5.3
title: Cyclic Groups
pagenum: 394; label: 5.4
title: Computer Arithmetic
pagenum: 398; label: 5.5
title: Binary Codes
pagenum: 403; label: 5.6
title: Combinatorics
pagenum: 413; label: *5.7
title: Enumeration by Group Action
pagenum: 417; label: *5.8
title: Pólya Theory of Enumeration
pagenum: 429; title: Suggested References
pagenum: 434; label: Chapter 6
title: Logic and Languages
pagenum: 436; label: 6.1
title: Polish Expressions
pagenum: 437; label: 6.2
title: Stacks and Queues
pagenum: 442; label: 6.3
title: Well-Formed Formulas
pagenum: 448; label: 6.4
title: Conversion to Polish Form
pagenum: 457; label: 6.5
title: Semantics and Tautology
pagenum: 462; label: 6.6
title: Axiomatics
pagenum: 470; label: 6.7
title: Turing Machines
pagenum: 474; label: 6.8
title: Undecidability
pagenum: 485; label: 6.9
title: Chomsky Grammars
pagenum: 493; title: Suggested References
pagenum: 502; title: Answers to Odd-Numbered Exercises
pagenum: 503; title: Index
pagenum: 539