Discrete Mathematics for Computer Scientists
This 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
88 pages matching finite in this book
Results 1-3 of 88
What people are saying - Write a review
We haven't found any reviews in the usual places.
The natural numbers
Sets relations and functions
18 other sections not shown
addition and multiplication adjacency matrix algorithm apply binary boolean algebra calculate Chapter circuit clause codeword colours corresponding countable deduce defined definition digits digraph domain edges elements encoding equal equation equivalence classes equivalence relation eulerian path example Exercises expression F F F F T F finite formula function f give given graph hamiltonian Hence induction hypothesis Induction step infinite input inverse isomorphic language Lemma length linear transformation matrix means method natural numbers notation notion obtain operations output partially ordered set path permutation planar graph polynomial positive integer possible predicate logic primitive recursive primitive recursive functions probability problem proof properties propositional logic propositional variables Prove radix real numbers register machine result Section semigroup sequence Show shown in Figure solution strings subset Suppose symbols Theorem tree truth table Turing machine vector space vertex vertices
Mathematik für Informatiker: Einführung an praktischen Beispielen aus der ...
No preview available - 2005
All Book Search results »
Algebraische Grundlagen der Informatik: Zahlen - Strukturen - Codierung ...
No preview available - 2007