Switching and Finite Automata Theory

by Zvi Kohavi

The book provides techniques useful in a wide variety of applications and helps develop a way of thinking that leads to understanding of the structure, behavior, and limitations and capabilities of logical machines. In this book the author has tried to cover the whole subject, starting with introductory material and leading to the more advanced topics, assuming a minimal technical background on the part of the reader. Table Of Contents: PART I : PRELIMINARIES Chapter 1. Number Systems and codes Chapter 2. Sets, Relations, and LatticesPART II : COMBINATIONAL LOGIC Chapter 3. Switching Algebra and Its ApplicationsChapter 4. Minimization of Switching Functions Chapter 5. Logical Design Chapter 6. Functional Decomposition and symmetric FunctionsChapter 7. Threshold Logic Chapter 8. Reliable Design and Fault Diagnosis PART III : FINITE-STATE MACHINES Chapter 9. Introduction To Synchronous Sequential Circuits and Iterative Networks Chapter Chapter 10. Capabilities, Minimization, and Transformation of Sequential Machines Chapter 11. Asynchronous Sequential Circuits Chapter 12. Structure of Sequential Machines Chapter 13. State-Identification and Fault-Detection Experiments Chapter 14. Memory, Definiteness, and Information Losslessness of Finite Automata Chapter 15. Linear Sequential Machines 16. Finite-State Recognizers Index

Genres: Computer Science

658 pages, Paperback

First published June 1, 1978