Logical Systems for Industrial Applications |
Contents
Introduction | 3 |
Boolean Algebra Logical Systems without Memory Combi | 23 |
Digital Finite Automata Logical Systems with Memory | 82 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
algorithm automata automaton basic binary Boolean algebra Boolean function calculated canonical form Chapter characteristics coding column combination table compatible construction conventional cost corresponding denoted diagram diode discussed edges elements equations equivalent example feedback field-effect transistors flip-flop frequently functors and operators Gdańsk given in Fig initial input signals input vector integrated circuits Karnaugh map load logical functors logical systems logical values LSM's magnetic matrix MEMORY operators method minimization modules monolithic monomials NAND functor negation normal form notation obtained output signal output vector P₁ pairs partition photoresistor possible prime implicants principle problem propositional calculus pulse Quine-McCluskey algorithm redundancy regular expressions relays Section semiconductor sequence shown in Fig SLFO's structure subsets subsystems switching symbol synthesis systems with memory theorems thyristors tion transition graph transition table two-state units variables vertices voltage Warszawa x₁ x₁ X2 x₂ Y₁