Switching and Sequential Systems
This course is designed to give seniors and first-year graduate students an introduction of sequential systems and finite-state machines. Topics include characterization of linear and nonlinear machines; synthesis and minimization of finite-state machines; machine identification; finite-memory machines; information lossless machines; finite-state recognizers; and machine learning, identification, and testing.
Sample reading list:
Kohavi and Jha, Switching and Finite Automata Theory
Weekly homework of 5-6 relevant questions. Estimated preparation time: 2 hours.
Mid Term Exam - 50%
Final Exam - 50%
Not Open to Freshmen.
Prerequisites and Restrictions:
|22285||L01||1:30 pm - 2:50 pm||M W||Enrolled:0 Limit:35|