Discrete Mathematical Structures with Applications to Computer Science

a₁ adjacency matrix algebraic system algorithm assume binary operation binary tree Boolean algebra Boolean expressions called circuit code word column complement congruence relation connectives consider corresponding coset cubes defined definition denote digit digraph discussed disjunctive disjunctive normal form edges element equivalence classes equivalence relation example F F F finite finite-state gate given in Fig go to step grammar graph H₁ Hasse diagram homomorphism identity infix expression input integer isomorphic Karnaugh map language lattice logical mapping maxterm minterms monoid n-tuple natural numbers node normal form NULL number system obtained one-to-one operands ordered pair output P V Q P₁ partially ordered set PL/I pointer predicate primitive recursive procedure real numbers representation represented S₁ semigroup sequence Show SOLUTION stack statement formula string structure subgroup subset symbol theorem tion truth table truth values Turing machine variables well-formed zero