National Science Library of Georgia

Image from Google Jackets

Switching and finite automata theory / Zvi Kohavi, Niraj K. Jha.

By: Contributor(s): Material type: TextTextPublisher: Cambridge : Cambridge University Press, 2010Edition: Third editionDescription: 1 online resource (xii, 617 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780511816239 (ebook)
Other title:
  • Switching & Finite Automata Theory
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 511.3/5 22
LOC classification:
  • QA267.5.S4 K64 2010
Online resources:
Contents:
Preface -- Part I. Preliminaries: 1. Number systems and codes -- 2. Sets, relations, and lattices -- Part II. Combinational Logic: 3. Switching algebra and its applications -- 4. Minimization of switching functions -- 5. Logic design -- 6. Multilevel logic synthesis -- 7. Threshold logic for nanotechnologies- -- 8. Testing of combinational circuits -- Part III. Finite State Machines: 9. Introduction to synchronous sequential circuits and iterative networks -- 10. Capabilities, minimization, and transformation of sequential machines -- 11. Asynchronous sequential circuits -- 12. Structure of sequential machines -- 13. State-identification experiments and testing of sequential circuits -- 14. Memory, definiteness, and information losslessness of finite automata -- 15. Linear sequential machines -- 16. Finite-state recognisers -- Index.
Summary: Understand the structure, behaviour, 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

Preface -- Part I. Preliminaries: 1. Number systems and codes -- 2. Sets, relations, and lattices -- Part II. Combinational Logic: 3. Switching algebra and its applications -- 4. Minimization of switching functions -- 5. Logic design -- 6. Multilevel logic synthesis -- 7. Threshold logic for nanotechnologies- -- 8. Testing of combinational circuits -- Part III. Finite State Machines: 9. Introduction to synchronous sequential circuits and iterative networks -- 10. Capabilities, minimization, and transformation of sequential machines -- 11. Asynchronous sequential circuits -- 12. Structure of sequential machines -- 13. State-identification experiments and testing of sequential circuits -- 14. Memory, definiteness, and information losslessness of finite automata -- 15. Linear sequential machines -- 16. Finite-state recognisers -- Index.

Understand the structure, behaviour, 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.

There are no comments on this title.

to post a comment.
Copyright © 2023 Sciencelib.ge All rights reserved.