This is a report on the second of a two course sequence in discrete mathematics taught at Ithaca College. The course covers three topics, combinatorics, finite state automata and regular languages and verification theory, and is a prerequisite for a theoretical course in computer science. The emphasis in this paper is the half semester spent teaching verification theory.
/lp/association-for-computing-machinery/discrete-mathematics-ii-nxcG1o8RcN