## Discrete Mathematical Structures With Applications to Computer Science |

### What people are saying - Write a review

User Review - Flag as inappropriate

Good book for a first year computer science student. However, the contents studied and their depth do not justify the length of the book.

User Review - Flag as inappropriate

this is very nice and student friendly book.The writer are all excellent.

### Other editions - View all

### Common terms and phrases

adjacency matrix algebraic system algorithm assume binary operation binary tree Boolean algebra Boolean expressions called circuit code word column complement congruence relation connectives consider contains corresponding coset cubes defined definition denote digit digraph discussed disjunctive disjunctive normal form edges element equivalence classes equivalence relation example FIGURE finite gate given in Fig go to step grammar graph Hasse diagram homomorphism identity infix expression integer isomorphic Karnaugh map language lattice logical mapping maxterm minterms monoid n-tuple natural numbers node normal form NULL number system obtained one-to-one operands ordered pair output P A Q P V Q partially ordered set Pi Pi Pi PL/I pointer predicate primitive recursive procedure real numbers representation represented semigroup sequence Show simple digraph solution stack statement formula string structure subgroup subset tautology theorem tion truth table truth values Turing machine variables well-formed zero

### References to this book

Web-Age Information Management: First International Conference, WAIM 2000 ... Hongjun Lu,Aoying Zhou No preview available - 2000 |

Computer-aided Design of VLSI Circuits and Systems Alberto Sangiovanni-Vincentelli No preview available - 1985 |