Switching and Automata Theory

This course provides theory and technique for design and analysis of combinational/sequential digital circuits using discrete mathematics. Topics include: basics for set, relation and lattices; switching and boolean algebra, and switching function; combinational logic synthesis by functional decomposition; fault detection in combinational / sequential circuits; structure of finite state automata; automata-to-machine transformation; state and machine identification; properties of finite state machine with memory span; inverse machine; communicating finite state machine and systems verification; binary decision diagram and its application. (Prerequisite: EE303)