000			03869cam a2200349 a 4500
001			15886590
005			20151123054422.0
008			090831s2010 enka b 001 0 eng
010			_a 2009036353
015			_aGBA984262 _2bnb
016	7		_a015357029 _2Uk
020			_a9780521857482 (hardback)
020			_a0521857481 (hardback)
020			_a9780521176804
035			_a(OCoLC)ocn318872059
050	0	0	_aQA267.5.S4 _bK64 2010
082	0	0	_a511.35 _222 _bKOH/S
100	1		_aKohavi, Zvi.
245	1	0	_aSwitching and finite automata theory / _cZvi Kohavi, Niraj K. Jha.
250			_a3rd ed. / _bNiraj Jha.
260			_aCambridge, UK ; _aNew York : _bCambridge University Press, _c2010.
300			_axii, 617 p. : _bill. ; _c26 cm.
504			_aIncludes bibliographical references and index.
505	0		_aPreface -- 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.
520			_a"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.
520			_a"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.
650		0	_aSequential machine theory.
650		0	_aSwitching theory.
700	1		_aJha, Niraj K.
856	4	2	_3Cover image _uhttp://assets.cambridge.org/97805218/57482/cover/9780521857482.jpg
942			_2ddc _cTB
999			_c877 _d877