## Discrete mathematical structures for computer science, Volume 2 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

aJ b LUBa | 182 |

the greatest lower bound of a and b p | 204 |

Chapter 5 | 241 |

Copyright | |

19 other sections not shown

### Other editions - View all

### Common terms and phrases

A U B algorithm array binary operation Boolean algebra Boolean expression called code words compute congruence relation Consider construct contains corresponding coset cycle decoding denoted determine digraph edges encoding function equivalence relation Example 4 Let EXERCISE SET Figure finite set finite-state machine given graph group G Hasse diagram homomorphism input integers isomorphic labeled language lattice Let G loop lower bound mathematical induction matrix monoid Moore machine multiplication table normal subgroup number of l's ordered pairs partial order partition path of length permutation poset positive integer programming Proof prove pseudocode quotient real numbers recursive reflexive regular expression result Section semigroup sentence sequence Show shown in Fig Solution statement steps string subgroup of G subroutine subset subtree Suppose symbol symmetric relation syntax diagram that/is Theorem transitive true truth table undirected upper bound variables verify vertex vertices