Theory of computation: formal languages, automata, and complexity
Theory of computation: formal languages, automata, and complexity
Discrete mathematics and its applications
Discrete mathematics and its applications
Teaching calculation and discrimination: a more effective curriculum
Communications of the ACM
Foundations of computer science
Foundations of computer science
Introducing functional programming in discrete mathematics
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
The Science of Programming
Teaching discrete structures: a systematic review of the literature
Proceedings of the 42nd ACM technical symposium on Computer science education
| Hi-index | 0.00 |
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.