Switching and finite automata theory, third edition

Zvi Kohavi; Niraj K. Jha

doi:10.1017/CBO9780511816239

Switching and finite automata theory, third edition

Zvi Kohavi, Niraj K. Jha

Research output: Book/Report › Book

7 Scopus citations

Abstract

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.

Original language	English (US)
Publisher	Cambridge University Press
Number of pages	617
Volume	9780521857482
ISBN (Electronic)	9780511816239
ISBN (Print)	9780521857482
DOIs	https://doi.org/10.1017/CBO9780511816239
State	Published - Jan 1 2009

All Science Journal Classification (ASJC) codes

General Engineering

Access to Document

10.1017/CBO9780511816239

Cite this

@book{6911a653906e440eb3fd960cecc8a947,

title = "Switching and finite automata theory, third edition",

abstract = "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.",

author = "Zvi Kohavi and Jha, {Niraj K.}",

note = "Publisher Copyright: {\textcopyright} The McGraw-Hill Companies Inc.and {\textcopyright} Z. Kohavi and N. Jha 2010.",

year = "2009",

month = jan,

day = "1",

doi = "10.1017/CBO9780511816239",

language = "English (US)",

isbn = "9780521857482",

volume = "9780521857482",

publisher = "Cambridge University Press",

address = "United Kingdom",

}

TY - BOOK

T1 - Switching and finite automata theory, third edition

AU - Kohavi, Zvi

AU - Jha, Niraj K.

PY - 2009/1/1

Y1 - 2009/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84923798719&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84923798719&partnerID=8YFLogxK

U2 - 10.1017/CBO9780511816239

DO - 10.1017/CBO9780511816239

M3 - Book

AN - SCOPUS:84923798719

SN - 9780521857482

VL - 9780521857482

BT - Switching and finite automata theory, third edition

PB - Cambridge University Press

ER -

Switching and finite automata theory, third edition

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this