Discrete Mathematics for Computer Scientists |
Contents
The natural numbers | 1 |
Sets relations and functions | 47 |
Algebraic topics | 99 |
Copyright | |
8 other sections not shown
Common terms and phrases
a₁ a₂ adjacency matrix algorithm alphabet b₁ b₂ binary boolean algebra calculate Chapter circuit codeword colours corresponding countable decoding deduce defined definition digits digraph edges elements encoding equal equation equivalence relation eulerian path example Exercises finite formula give given graph Hence induction hypothesis Induction step infinite input inverse isomorphic language Lemma length linear code linear transformation linearly logic matrix means method natural numbers notation notion obtain operations ordered set output P₁ pairs parity check partially ordered partially ordered set path permutation polynomial positive integer possible primitive recursive primitive recursive functions probability problem proof Prove radix real numbers register machine result Section semigroup sequence Show shown in Figure strings subset Suppose symbols Theorem transitive tree truth tables Turing machine V₁ V₂ vector space vertex vertices