Discrete Mathematical Structures
Prentice Hall, 2000 - Computer science - 505 pages
More than any other book in the field, this text ties together discrete topics with a theme. Written at an appropriate level of rigor - with a strong pedagogical focus - it limits depth of coverage and areas covered to topics of genuine use in computer science. An emphasis on both basic theory and applications provides students with a firm foundation for more advanced courses.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
algorithm array Basis step binary operation Boolean algebra Boolean matrix called Chapter code words Compute congruence relation Consider construct contains corresponding coset cycle decoding denoted described determine digraph elements encoding function equivalence relation Euler circuit Euler path Example Exercise Set false finite set finite-state machine given grammar Hamiltonian circuit Hasse diagram Hence homomorphism identity Induction step input integers isomorphic labeled language lattice least Let G mathematical induction monoid Moore machine multiplication node partial order partition path of length permutations pigeonhole polynomial poset positive integer proof properties Prove pseudocode quotient real numbers recurrence relation recursive reflexive regular expression represent result Section semigroup sequence shown in Figure Solution statement string structure subgroup of G subroutine subset subtree Suppose symbol symmetric relation Theorem transitive true truth table undirected variables vertex vertices Write