Switching and Finite Automata Theory - 9780521857482

Kohavi (Technion-Israel Institute of Technology, Israel) and Jha (Princeton U., US) present the third edition of their text on switching and finite automata theory for advanced undergraduate and beginning graduate students in electrical engineering and computer science. Added to this edition are materials on CMOS logic; modern two-level and multi-level logic synthesis methods; logic design for emerging nanotechnologies; test generation, design for testability, and built-in self-test for combinational and sequential circuits; and modern asynchronous circuit synthesis techniques, among other recent topics. References to applications have also been updated. The text has been designed to be used in a two semester sequence, with chapters on number systems and codes; switching algebra and its applications; minimization of switching functions; logic design; multi-level logic synthesis; threshold logic for nanotechnologies; testing of combinational circuits; synchronous sequential circuits and iterative networks; capabilities, minimization, and transformation of sequential machines; memory, definiteness, and information losslessness of finite automata; linear sequence machines; and finite-state recognizers serving a second semester on finite automata theory. The authors proceed from introductory material to more advanced topics and the technical background assumed on the part of the reader is minimal. Annotation ©2010 Book News, Inc., Portland, OR (booknews.com)