000			02909nam a22003738i 4500
001			CR9780511816239
003			UkCbUP
005			20200124160249.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			101021s2010||||enk o ||1 0|eng|d
020			_a9780511816239 (ebook)
020			_z9780521857482 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA267.5.S4 _bK64 2010
082	0	0	_a511.3/5 _222
100	1		_aKohavi, Zvi, _eauthor.
245	1	0	_aSwitching and finite automata theory / _cZvi Kohavi, Niraj K. Jha.
246	3		_aSwitching & Finite Automata Theory
250			_aThird edition.
264		1	_aCambridge : _bCambridge University Press, _c2010.
300			_a1 online resource (xii, 617 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
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			_aUnderstand 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.
650		0	_aSequential machine theory.
650		0	_aSwitching theory.
700	1		_aJha, Niraj K., _eauthor.
776	0	8	_iPrint version: _z9780521857482
856	4	0	_uhttps://doi.org/10.1017/CBO9780511816239
999			_c519294 _d519292