Courses
CATALOG DESCRIPTIONS
Back to Previous Page
CS 671 Switching and Automata I
Description:
Analysis and synthesis of combinational
and sequential switching circuits.
Boolean algebras, switching functions,
minimization, single and multiple output
networks, realization of functions. Finitestate
sequential machines, state-transition
diagrams, machine and state equivalence,
incompletely specified machines, state
reduction, machine realizations.
Credits: 2 ½:0:0:3
Pre-Requisite: CS 600
Co-Requisite: none
Notes: none
|
