| MUET / Departments / Computer Systems & Software Engineering / Course of SW /Theory Of Automata |  |
THEORY OF AUTOMATA Theory (100) SWITCHING ALGEBRA AND ITS APPLICATIONS Switching Algebra, Switching functions, Isomorphic Systems, Propositional Calculus, Conditional Propositions of Logical Equivalence, Proofs and Arguments, Categorical Propositions ADVANCED TECHNIQUES FOR MINIMIZATION OF SWITCHING FUNCTIONS Introduction, Map Method, Minimal Functions & their properties, Tabulation Method DESIGN TECHNIQUES Design with Basic Logical Gates - Relay Contacts, Design with Integrated Circuits, NAND & NOR Circuits, Design of High Speed Address DECOMPOSITION OF SYMMETRY OF FUNCTIONS Functional Decomposition, Symmetric Networks, Identification of Symmetric functions THRESHOLD LOGIC Introduction, The Threshold Elements, Capabilities & limitation of threshold Logic, Synthesis of Threshold Networks, Geometrical representation
REFERENCE BOOKS [1 ] Zvi Kohavi, “Switching & Finite Automata theory”[2 ] Richard Johnsonbaugh, “Discrete Mathematics” [3 ] “Set Theory”, Scham Series
|
