Synopses & Reviews
Presents a serious, mathematical treatment of discrete structures appropriate for beginning computing students and ties the discrete math topics to concrete computer science examples. Covers formal systems, functions and relations, Boolean algebras, counting and cardinality, graphs and trees, introduction to formal languages, and computability theory.
Table of Contents
Formal Systems.
Functions and Relations.
Boolean Algebras.
Boolean Algebra and Logic Design.
Lattices and Their Applications.
Cardinality and Countability.
Graphs and Their Use in Computing.
Introduction to Formal Languages.
Computability.
Index.