ECE 552: Switching and Finite Automata Theory |
||
Course Description |
||
| ECE 552 is an introduction to classical switching and finite automata theory. This course forms the basis upon which computer engineering is founded. If you are a student choosing to obtain an MS in Computer Engineering, this is a required course. Since you will encounter this material throughout your advanced studies, it is strongly recommended that this be taken in the first semester of your graduate program. | ||
Course Topics |
||
| Mathematical foundations Switching algebras Minimization of switching functions Functional decomposition Gated and contact networks Symmetric functions Threshold logic Fault identification and detection Synchronous sequential circuits Iterative networks Finite state machines Asynchronous circuit design, including both fundamental and pulse modes Turing machines Mealy and Moore machines State-machine programming Structure of sequential machines Minimization of sequential machines Linear sequential machines State reduction and canonical forms of linear machines Regular expressions |
||
Helpful Downloads |
||
| Course Syllabus | WMU Bookstore | |
| Lecture Notes | ||
| Textbook | ||
| Sample Tests and Solutions | ||
| Demonstration Computer Programs | ||
| Tests and Solutions | ||
| ***Lecture and Assignment Schedule*** | ||