Discrete Mathematical Structures with Applications to Computer Science |
Contents
Mathematical Logic 1 | 31 |
Algebraic Structures | 270 |
Introduction to Computability Theory | 557 |
Copyright | |
2 other sections not shown
Other editions - View all
Common terms and phrases
a₁ adjacency matrix algebraic system algorithm assume binary operation binary tree Boolean algebra Boolean expressions called circuit code word column congruence relation connectives consider contains corresponding coset cubes defined definition delete denote diagram digit digraph discussed disjunctive disjunctive normal form edge element equivalence classes equivalence relation example F F F FIGURE finite gate given in Fig go to step grammar graph H₁ Hasse diagram homomorphism identity infix expression integer isomorphic Karnaugh map language logical mapping maxterm minterms monoid n-tuple natural numbers node normal form number system obtained one-to-one operands ordered pair output P V Q P₁ partial ordering path PL/I pointer predicate primitive recursive procedure real numbers representation represented semigroup sequence Show simple digraph SOLUTION stack statement formula string structure subgroup subset theorem tion truth table truth values Turing machine variables well-formed zero