Discrete Mathematics for Computer ScientistsThis is a new edition of a successful introduction to discrete mathematics for computer scientists, updated and reorganised to be more appropriate for the modern day undergraduate audience. Discrete mathematics forms the theoretical basis for computer science and this text combines a rigorous approach to mathematical concepts with strong motivation of these techniques via practical examples. Key Features
0201360616B04062001 |
Contents
The natural numbers | 1 |
Introductory logic | 48 |
Sets relations and functions | 85 |
Copyright | |
13 other sections not shown
Common terms and phrases
adjacency matrix algorithm alphabet b₁ binary boolean algebra calculate Chapter circuit codeword colours corresponding decoding deduce defined definition digits digraph edges elements encoding equal equation equivalence relation eulerian path example Exercises expression F F F F T F finite formula function f give given graph Hence induction hypothesis Induction step infinite input inverse isomorphic language Lemma length linear code linear transformation matrix method minimum distance natural numbers notation notion obtain operations pairs parity check partial ordering partially ordered set path polynomial possible predicate logic primitive recursive primitive recursive functions probability problem proof propositional variables Prove radix real numbers register machine result Section semigroup sequence Show shown in Figure strings subset Suppose symbols Theorem tree truth table Turing machine V₁ vector space vertex vertices w₁