Switching and Finite Automata Theory: Computer Science Series / Edition 2

Switching and Finite Automata Theory: Computer Science Series / Edition 2

4.0 2
by Zvi Kohavi, Edward A. (Ed.) Feigenbaum, Richard W. (Ed.) Hamming
     
 

ISBN-10: 0070353107

ISBN-13: 9780070353107

Pub. Date: 01/28/1978

Publisher: McGraw-Hill Higher Education

Product Details

ISBN-13:
9780070353107
Publisher:
McGraw-Hill Higher Education
Publication date:
01/28/1978
Series:
Computer Science Series
Edition description:
2d ed
Pages:
658
Product dimensions:
6.34(w) x 9.32(h) x 1.27(d)

Related Subjects

Table of Contents

Preface xi
PART ONE PRELIMINARIES
Number Systems and Codes
3(21)
Number Systems
3(7)
Binary Codes
10(4)
Error Detection and Correction
14(10)
Notes and References
20(1)
Problems
21(3)
Sets, Relations, and Lattices
24(17)
Sets
24(2)
Relations
26(4)
Partially Ordered Sets
30(3)
Lattices
33(8)
Notes and References
36(1)
Problems
36(5)
PART TWO COMBINATIONAL LOGIC
Switching Algebra and Its Applications
41(33)
Switching Algebra
42(6)
Switching Functions
48(10)
Isomorphic Systems
58(5)
Electronic-Gate Networks
63(1)
Boolean Algebras
64(10)
Notes and References
66(1)
Problems
67(7)
Minimization of Switching Functions
74(39)
Introduction
74(2)
The Map Method
76(10)
Minimal Functions and Their Properties
86(4)
The Tabulation Procedure for the Determination of Prime Implicants
90(5)
The Prime Implicant Chart
95(8)
Map-entered Variables
103(10)
Notes and References
105(1)
Problems
106(7)
Logical Design
113(49)
Design with Basic Logical Gates
114(5)
Logic Design with Integrated Circuits
119(15)
NAND and NOR Circuits
134(4)
Design of High-Speed Adders
138(6)
Relay Contacts
144(1)
Analysis and Synthesis of Contact Networks
145(17)
Notes and References
153(1)
Problems
154(8)
Functional Decomposition and Symmetric Functions
162(27)
Functional Decomposition
162(11)
Symmetric Networks
173(7)
Identification of Symmetric Functions
180(9)
Notes and References
184(1)
Problems
185(4)
Threshold Logic
189(25)
Introductory Concepts
190(7)
Synthesis of Threshold Networks
197(17)
Notes and References
209(1)
Problems
209(5)
Reliable Design and Fault Diagnosis
214(61)
Hazards
214(4)
Fault Detection in Combinational Circuits
218(5)
Fault-Location Experiments
223(5)
Boolean Differences
228(6)
Fault Detection by Path Sensitizing
234(4)
Detection of Multiple Faults
238(12)
Failure-Tolerant Design
250(8)
Quadded Logic
258(17)
Notes and References
263(2)
Problems
265(10)
PART THREE FINITE-STATE MACHINES
Introduction to Synchronous Sequential Circuits and Iterative Networks
275(47)
Sequential Circuits---Introductory Example
276(4)
The Finite-State Model---Basic Definitions
280(3)
Memory Elements and Their Excitation Functions
283(8)
Synthesis of Synchronous Sequential Circuits
291(14)
An Example of a Computing Machine
305(4)
Iterative Networks
309(13)
Notes and References
315(1)
Problems
315(7)
Capabilities, Minimization, and Transformation of Sequential Machines
322(34)
The Finite-State Model---Further Definitions
322(3)
Capabilities and Limitations of Finite-State Machines
325(2)
State Equivalence and Machine Minimization
327(6)
Simplification of Incompletely Specified Machines
333(23)
Notes and References
348(1)
Problems
348(8)
Asynchronous Sequential Circuits
356(29)
Fundamental-Mode Circuits
356(2)
Synthesis
358(10)
State Assignment in Asynchronous Sequential Circuits
368(5)
Pulse-Mode Circuits
373(12)
Notes and References
375(1)
Problems
376(9)
Structure of Sequential Machines
385(64)
Introductory Example
385(3)
State Assignments Using Partitions
388(6)
The Lattice of Closed Partitions
394(3)
Reduction of the Output Dependency
397(3)
Input Independence and Autonomous Clocks
400(3)
Covers and Generation of Closed Partitions by State Splitting
403(8)
Information Flow in Sequential Machines
411(9)
Decomposition
420(10)
Synthesis of Multiple Machines
430(19)
Notes and References
435(2)
Problems
437(12)
State-Identification and Fault-Detection Experiments
449(58)
Experiments
450(4)
Homing Experiments
454(4)
Distinguishing Experiments
458(5)
Machine Identification
463(1)
Fault-Detection Experiments
464(6)
Design of Diagnosable Machines
470(6)
Second Algorithm for the Design of Fault-Detection Experiments
476(3)
Fault-Detection Experiments for Machines Which Have no Distinguishing Sequences
479(28)
Bounds on the Length of Synchronizing Sequences
491(4)
Bounds on the Length of Distinguishing Sequences
495(1)
Notes and References
495(1)
Problems
496(11)
Memory, Definiteness, and Information Losslessness of Finite Automata
507(50)
Memory Span with Respect to Input-Output Sequences (Finite-Memory Machines)
508(5)
Memory Span with Respect to Input Sequences (Definite Machines)
513(5)
Memory Span with Respect to Output Sequences
518(4)
Information Lossless Machines
522(14)
Synchronizable and Uniquely Decipherable Codes
536(21)
The Least Upper Bound for Information Losslessness of Finite Order
543(3)
Notes and References
546(1)
Problems
547(10)
Linear Sequential Machines
557(52)
Introduction
557(3)
Inert Linear Machines
560(7)
Inert Linear Machines and Rational Transfer Functions
567(6)
The General Model
573(5)
Reduction of Linear Machines
578(9)
Identification of Linear Machines
587(6)
Application of Linear Machines to Error Correction
593(16)
Basic Properties of Finite Fields
596(2)
The Euclidean Algorithm
598(1)
Notes and References
599(1)
Problems
600(9)
Finite-State Recognizers
609(44)
Deterministic Recognizers
610(1)
Transition Graphs
611(3)
Converting Nondeterministic into Deterministic Graphs
614(3)
Regular Expressions
617(6)
Transition Graphs Recognizing Regular Sets
623(8)
Regular Sets Corresponding to Transition Graphs
631(7)
Two-Way Recognizers
638(15)
Notes and References
645(1)
Problems
646(7)
Index 653

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >

Switching and Finite Automata Theory: Computer Science Series 3 out of 5 based on 0 ratings. 1 reviews.
Anonymous More than 1 year ago