Semester Hours:3Once a Year
Review of Boolean algebra and combinatorial circuits. Karnaugh maps. Finite-state transducers. Deterministic and non-deterministic finite-state automata. State minimization, incompletely specified machines, testing sequences. Lattices, regular sets.
Prerequisite(s)/Course Notes: Course open to graduate students in computer science; others need permission from computer science graduate director.