David T. Brown
Skip Abstract Section
Abstract
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.
- 1. Aho, A. V, and Ullman, J. D., Foundations of Computer Science, Computer Science Press, New York, 1992. Google Scholar
Digital Library
- 2. Brookshear, J. Glenn, Theory of Computation: Formal Languages, Automata, and Complexity, The Benjamin/Cummings Publishing Company, Inc., New York, 1989. Google ScholarDigital Library
- 3. Gries, David, "Teaching Calculation and Discrimination: A More Effective Curriculum", Communications of the ACM, volume 43, number 3, March 1991, pages 44-55. Google ScholarDigital Library
- 4. Gries, David, The Science of Programming, Springer-Verlag, New York, 1981. Google ScholarDigital Library
- 5. Rosen, Kenneth H., Discrete Mathematics and its Applications, The Random House, New York, 1988. Google ScholarDigital Library
- 6. Wainwrite, Roger, "Introducing Functional Programming in Discrete Mathematics", SIGSCE Bulletin, volume 24, number 1, March 1992, pages 147-152. Google ScholarDigital Library
Recommendations
Discrete mathematics
Encyclopedia of Computer Science
Discrete mathematics encompasses those branches of mathematics that deal with discrete objects, in contrast to other branches, such as calculus and analysis, whose main concern is with continuous functions. Some branches of mathematics, such as ...
Comments