Switching and finite automata theory

3rd ed. / Niraj Jha.
  • 4.50 ·
  • 2 Ratings
  • 20 Want to read
  • 1 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 4.50 ·
  • 2 Ratings
  • 20 Want to read
  • 1 Currently reading
  • 0 Have read


Download Options

Buy this book

Last edited by ImportBot
December 19, 2023 | History

Switching and finite automata theory

3rd ed. / Niraj Jha.
  • 4.50 ·
  • 2 Ratings
  • 20 Want to read
  • 1 Currently reading
  • 0 Have read

"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"--Provided by publisher.

"Topics in switching and finite automata theory have been an important part of the curriculum in electrical engineering and computer science departments for several decades. The third edition of this book builds on the comprehensive foundation provided by the second edition and adds: significant new material in the areas of 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; modern asynchronous circuit synthesis techniques; etc. We have attempted to maintain the comprehensive nature of the earlier edition in providing readers with an understanding of the structure, behavior, and limitations of logical machines. At the same time, we have provided an up-to-date context in which the presented techniques can find use in a variety of applications.We start with introductory material and build up to more advanced topics. Thus, the technical background assumed on the part of the reader is minimal"--Provided by publisher.

Publish Date
Language
English
Pages
617

Buy this book

Previews available in: English

Edition Availability
Cover of: Switching and Finite Automata Theory
Switching and Finite Automata Theory
2012, Cambridge University Press
in English
Cover of: Switching and finite automata theory
Switching and finite automata theory
2010, Cambridge University Press
in English - 3rd ed. / Niraj Jha.
Cover of: Switching and Finite Automata Theory
Switching and Finite Automata Theory
2009, Cambridge University Press
in English
Cover of: Switching and Finite Automata Theory
Switching and Finite Automata Theory
2009, Cambridge University Press
in English
Cover of: Switching and finite automata theory
Switching and finite automata theory
2009, Cambridge University Press
in English - 3rd ed. / Niraj Jha.
Cover of: Switching and Finite Automata Theory
Switching and Finite Automata Theory
2009, Cambridge University Press
in English
Cover of: Switching and finite automata theory
Switching and finite automata theory
1978, McGraw-Hill
in English - 2d ed.
Cover of: Switching and finite automata theory.
Switching and finite automata theory.
1978, Tata McGraw-Hill
in English - 2nd ed.
Cover of: Switching and finite automata theory.

Add another edition?

Book Details


Published in

Cambridge, UK, New York

Table of 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.

Edition Notes

Includes bibliographical references and index.

Classifications

Dewey Decimal Class
511.3/5
Library of Congress
QA267.5.S4 K64 2010, QA267.5.S4

The Physical Object

Pagination
xii, 617 p. :
Number of pages
617

ID Numbers

Open Library
OL24094647M
Internet Archive
switchingfinitea00koha_742
ISBN 10
0521857481
ISBN 13
9780521857482
LCCN
2009036353

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
December 19, 2023 Edited by ImportBot import existing book
December 3, 2022 Edited by ImportBot import existing book
December 23, 2020 Edited by MARC Bot import existing book
October 9, 2020 Edited by ImportBot import existing book
March 18, 2010 Created by ImportBot Imported from Library of Congress MARC record.