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.

The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata.

This comprehensive text on switching theory and logic design is designed for the undergraduate students of electronics and communication engineering, electrical and electronics engineering, electronics and instrumentation engineering, telecommunication engineering, computer science and engineering, and information technology. It will also be useful to AMIE, IETE and diploma students. Written in a student-friendly style, this book, now in its Second Edition, provides an in-depth knowledge of switching theory and the design techniques of digital circuits. Striking a balance between theory and practice, it covers topics ranging from number systems, binary codes, logic gates and Boolean algebra to minimization using K-maps and tabular method, design of combinational logic circuits, synchronous and asynchronous sequential circuits, and algorithmic state machines. The book discusses threshold gates and programmable logic devices (PLDs). In addition, it elaborates on flip-flops and shift registers. Each chapter includes several fully worked-out examples so that the students get a thorough grounding in related design concepts. Short questions with answers, review questions, fill in the blanks, multiple choice questions and problems are provided at the end of each chapter. These help the students test their level of understanding of the subject and prepare for examinations confidently. NEW TO THIS EDITION • VHDL programs at the end of each chapter • Complete answers with figures • Several new problems with answers

Formal languages and automata theory is the study of abstract machines and how these can be used for solving problems. The book has a simple and exhaustive approach to topics like automata theory, formal languages and theory of computation. These descriptions are followed by numerous relevant examples related to the topic. A brief introductory chapter on compilers explaining its relation to theory of computation is also given.

This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Please note, Gradiance is no longer available with this book, as we no longer support this product.

Provides students with a system-level perspective and the tools they need to understand, analyze and design complete digital systems using VHDL. It goes beyond the design of simple combinational and sequential modules to show how such modules are used to build complete systems, reflecting digital design in the real world.