Discrete Mathematics for Computer Scientists |
Contents
The natural numbers | 1 |
Sets relations and functions | 52 |
Algebraic topics | 99 |
Copyright | |
9 other sections not shown
Common terms and phrases
a₁ a₂ adjacency matrix algorithm alphabet b₁ b₂ binary boolean algebra calculate clause codeword colours contents of register corresponding coset decoding deduce defined definition digits digraph edges elements encoding equal equation equivalence relation eulerian eulerian path example Exercises finite formula given graph Halt hamiltonian circuit hamiltonian path Hence induction hypothesis Induction step infinite input integer isomorphic language Lemma length linear code linearly logic method multiplication natural numbers notion obtain operations output P₁ partially ordered path planar planar graph polynomial possible primitive recursive functions probability problem proof propositional logic propositional variables Prove radix register machine result Section sequence Show shown in Figure string subset Suppose symbols Theorem transitive tree truth table Turing machine V₁ V₂ vector space vertex vertices w₁ w₂ x₁