ロード中...
Switching and finite automata theory /
"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 st...
| 第一著者: | |
|---|---|
| その他の著者: | |
| フォーマット: | Printed Book |
| 出版事項: |
Cambridge, UK ; New York :
Cambridge University Press,
2010.
|
| 版: | 3rd ed. / |
| 主題: | |
| オンライン･アクセス: | http://assets.cambridge.org/97805218/57482/cover/9780521857482.jpg |
目次:
- 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.