Switching and Sequential Systems
This course is designed to give seniors and first-year graduate students an introduction to switching and sequential systems. Topics include threshold logic for nanotechnology; digital system testing; finite-state machine synthesis and minimization; asynchronous sequential circuits; structure of sequential machines; machine identification; memory, definiteness and information losslessness of finite automata; finite-state recognizers.
Sample reading list:
Kohavi and Jha, Switching and Finite Automata Theory, Third Ed., McGraw-Hill
Weekly homework of 5-6 relevant questions. Estimated preparation time: 2 hours.
Mid Term Exam - 40%
Final Exam - 60%
Not Open to Freshmen.
Prerequisites and Restrictions:
|21145||L01||1:30 pm - 2:50 pm||M W||Friend Center 004||Enrolled:11 Limit:35|