COMPSCI 250: Introduction to Theory of Computation
Undergraduate Course, Graduate Teaching Assistant, UMass Amherst, Computer Science Department, 2022
Fall 2022
Basic concepts of discrete mathematics useful to computer science: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, basic number theory. Induction and recursion: interplay of inductive definition, inductive proof, and recursive algorithms. Graphs, trees, and search. Finite-state machines, regular languages, nondeterministic finite automata, Kleene’s Theorem.