Switching and Finite Automata Theory (McGraw-Hill Computer Science Series). This item is unavailable.Switching and Finite Automata Theory (McGraw-Hill Computer Science Series)

Understand the structure, behavior, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.

Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition. New material includes CMOS gates, logic synthesis, nanotechnologies, digital system testing, and asynchronous circuit design; there are also 200 illustrative examples and over 350 end-of-chapter review problems, instructor solutions and lecture slides.