Bibliography

1 Ajzerman, M. A., Gusev, L. A., Rosonoer, L.1., Smirnova, 1. M., Tal', A. A., Logika, avtomaty, algoritmy, Gosudarstvennoe izdatel'stvo fiziko-matemati­ceskoj literatury. Moscow 1963.

2 Arden, D. N.: Delayed Logic and Finite-State Machines, Proc. AlEE Second Annual Symp. on Switching Theory and Logical Design, Detroit 1961, pp. 133-151.

3 Arnold, B. H.: Logic and Boolean Algebra, Englewood Cliffs: Prentice· Hall 1962.

4 Arnold, R. F., Harrisson, M. A.: Algebraic Properties of Symmetric and Partially Symmetric Boolean Functions, IEEE Transactions on Electronic Computers, Vol. EC-l2, 244-251 (1963).

5 Ashenhurst, R. L.: The Decomposition of Switching Functions, Proceedings of an International Symposium on the Theory of Switching, April 2-5, Vol. 29 of Annals of Computation Laboratory of Harvard University, 74-116 (1959).

6 Aufenkamp, D. D., Hohn, F. E.: Analysis of Sequential Machines, (I) IRE Transactions on Electronic Computers, Vol. EC·G, 276-295 (1957).

7 Aufenkamp, D. D.: Analysis of Sequential Machines (II), IRE Transactions on Electronic Computers, Vol. EC-7, 299-306 (1958).

8 Bartee, T. C.: Digital Computer Fundamentals, New York: McGraw-Hill (1960). 9 Bartee, T. C.: Computer Design of Multiple-output Logical Networks, IRE

Transactions on Electronic Computers, Vol. EC-lO, 21-30 (1961). 10 Bartee, T. C .. Lebow, 1. L., Reed, 1. S.: Theory and Design of Digital Machines.

New York: McGraw-Hill 1962. 11 Bazilevskii, Ju., Ja.: The Theory of Mathematical Machines. New York:

Pergamon Press 1963. 12 Bergel'son, M. N., Vlasov, F. S.: Postroenie reversivnykh scetCikov dvoicno­

refieksnogo koda, Vycislitelnaja tekhnika, Sbornik No.4, 74-81, Izdatel'stvo, MaSinostroenie, Moscow (1964).

13 Birkhoff, G., McLane, S.: A Survey of Modern Algebra. New York: MacMillan 1961.

14 Biswas, N. N.: The Logic and Input Equations of Flip-Flops, Electronic Engineering, 38, 107-111 (1966).

15 Bodnarcuk, V. G.: Sistemy uravnenij v algebre sobytij, Z. Vyc. Mat. i Mat. Fiz, 3, No.6, 1077-1088 (1963).

16 Boole, G.: An Investigation of the Laws of Thought, London 1854 (Reprinted Dover).

17 Boucher, H.: Organisation et fonctionnement des machines arithmetiques. Paris: Masson 1960.

18 Brunin, J.: Logique binaire et commutation. Paris: Dunod 1965. 19 Brzozowski, J. A.: Canonical Regular Expressions and Minimal State Graphs for

Definite Events, Proceedings of the Symposium on the Mathematical Theory of Automata, Polytechnic Press of the Polytechnic Institute of Brooklyn, pp. 529-561 (1962).

498 Bibliography

20 Brzozowski, J. A.: A Survey of Regular Expressions and their Applications, IRE Transactions on Electronic Computers, Vol. EC-11, 324-335 (1962).

21 Brzozowski, J. A., McCl'U8key, E. J.: Signal Flow-graph Techniques and Sequential Circuit State Diagrams. IEEE Transactions on Electronic Com­puters, Vol. EC-l2, 67-76 (1963).

22 Brzozowski, J. A., Poage, J. F.: On the Construction of Sequential Machines from Regular Expressions, IEEE Transactions on Electronic Computers, Vol. EC-l2, 402-403 (1963).

23 Brzozowski, J. A.: Derivatives of Regular Expressions, J. Association for Com­puting Machinery, 11, 481-494 (1964).

24 Bucki, J. R.: Regular Canonical Systems. Arch. f, math. Logik u. Grundlagen­forsch. H. 6/3-4,91-111.

25 Burks, A. W., Wright, J. B.: Theory of Logical Nets. Proc. IRE, Vol. 41, pp. 1357-1365 (1953).

26 Caldwell, S. H.: Switching Circuits and Logical Design. New York: J. Wiley 1958.

27 Carnap, R.: Introduction to Symbolic Logic and its Applications. New York: Dover Publications 1958.

28 Carvallo, M.: Monographie des treillis et algebre de Boole. Paris: Gauthier­Villars 1962.

29 Carvallo, M.: Principes et applications de I'analyse booleenne. Paris': Gauthier­Villars 1965.

30 Castello, P.: Cie des scMmas electriques. Etude logique des circuits et automa­tismes. Paris: Dunod 1965.

31 Chauvineau, J.: La logique moderne, Presses Universitaires de France, 1957. 32 Christiansen, B., Lichtenberg, J., Pedersen, J.: Almene begreber fra logik,

moengdeloere og algebra. Copenhagen: Munksgaard 1964. 33 Chu, Y.: Digital Computer Design Fundamentals. New York: McGraw-Hill

1962. 34 Church, A., Introduction to Mathematical Logic, Vol. 1, Princeton: Princeton

University Press 1956. 35 Cohen, D.: Truth Table Logic Speeds BCD-binary Conversions. Control Eng.,

78-81 (1964). 36 Constantinescu, P.: Asupra reducerii numarului de contacte prin introducerea

circuitelor in punte. Analele Univ. C. 1. Parhon, Nr. 11-Seria S~iinyelor Naturii, 45-69 (1956).

37 Constantinescu, P.: Ob analize i sinteze relejno-kontaktnykh mnogopoljusnikov c ventil'nymi elementami. Bull. Math. Soc. Sci. Math. Phys. de RPR, 3, (51), 21-64 (1959),3 (51), 137-163 (1959).

38 Constantinescu, P.: Asupra sintezei schemelor cu func~ionare in mai multi timpi pulsatorii. Analele UniversitaW Bucurel]ti, Seria :;;tiinyele Naturii, Mate­matica-Fizica, pp. 129-136 (1961).

39 Copi, 1., Elgot, C., Wright, J.: Realization of Events by Logical Nets. J. Asso­ciation for Computing Machinery 0,181-196 (1958).

40 Croy, J. E.: Rapid Technique of Manual or Machine Binary-to-Decimal Integer Conversion Using Decimal Radix Arithmetic. IRE Transactions on Electronic Computers, Vol. EC-lO, 777 (1961).

41 Curtis, H. A.: A New Approach to the Design of Switching Circuits. Princeton: D. Van Nostrand 1962.

42 Dea;n, K. J.: An Introduction to Counting Techniques and Transistor Circuit Logic. London: Chapman and Hall 1964.

Bibliography 499

43 Denis Papin, M., Faure, R., Kaufmann, A.: Cours de calcul booll~ien applique Paris: Albin Michel 1963.

44 Dubisch, R.: Lattices to Logic. New York: Blaisdell 1964. 45 Dugue, D.: Ensembles mesurables et probabilisables. Paris: Dunod 1958. 46 Eichelberger, E. E.: Hazard Detection in Combinational and Sequential Switch.

ing Circuits. IBM J. of Research and Development, 9,90-99 (1965). 47 Elgot, C. C.: Decision Problems of Finite Automata Design and Related Arith·

metics. Trans. Am. Math. Soc. 98,21-51 (1961). 48 Fenstad, J. E.: Algoritmer i matematikken: en inforing in den rekursive

matematikk og dens anvendelse. I, II, Nordisk matematisk tidskrift, 12, 17-35,99-111 (1964).

49 Flegg, H. G.: Boolean Algebra and its Applications. London: Blackie 1964. 50 Flores,!.: Computer Logic, Englewood Cliffs: Prentice Hall 1960. 51 Flores,!.: The Logic of Computer Arithmetic. Englewood Cliffs: Prentice Hall

1963. 52 Francois, E.: Analyse et synthese de structures logiques selon Ie critere de

fiabilite. Une methode de synthese particuliere aux logiques sequentielles. Annales de Radioelectricite, tome XX, 310-323 (1965).

53 Garner, H. L.: The Residue Number System, IRE Transactions on Electronic Computers, Vol. EC·8, 140-147 (1959).

54 Gazale, M. J . .' Les structures de commutation it m valeurs et les calculatrices numeriques. Paris: Gauthier·Villars 1959.

55 Ghiron, H.: Rules to Manipulate Regular Expressions of Finite Automata, IRE Transactions on Electronic Computers, Vol. EC.H, 574-575 (1962).

56 Gill, A.: Introduction to the Theory of Finite·state Machines. New York: McGraw·Hill1962.

57 Ginsburg, S.: A Synthesis Technique for Minimal·state Sequential Machines. IRE Transactions on Electronic Computers, Vol. EC·8, 13-24 (1959).

58 Ginsburg, S.: A Technique for the Reduction of a Given Machine to a Minimal State Machine, IRE Transactions on Electronic Computers, Vol. EC·8, 346-356 (1959).

59 Ginsburg, S.: Synthesis of Minimal State Machines, IRE Transactions on Electronic Computers, Vol. EC·8, 441-449 (1959).

60 Ginsburg, S.: An Introduction to Mathematical Machine Theory. Reading, Massachusetts: Addison·Wesley 1962.

61 Gitis, E.!.: ScetCiki v dvoicnom cikliceskom kode, Avtomatika i Telemekhani· ka, Tom XXV, 1104-1113 (1964).

62 Gluskov, V. M.: Nekotorye problemy sinteza cifrovykh avtomatov, Vycisl. matem. i matem. fizika, No.3, 371-411 (1961).

63 GluJkov, V. M.: Abstraktnaja teorija avtomatov, Uspekhi mat. nauk. T. XVI, vyp. 5(101) 3-62 (1961).

64 GluJkov, V. M.: Sintez cifrovykh avtomatov, Fizmatgiz, Moscow 1962. 65 GluJkov, V. M.: Vvedenie v kibernetiku. Izdatelstvo akademii nauk ukrainskoj

SSR. Kiev 1964. 66 Goering, 0.: Radix Conversion in a Hexadecimal Machine, IEEE Transactions

on Electronic Computers. Vol. EC·1S, 154-155 (1964). 67 Gradstejn, 1. S.: Prjamaja i obratnaja teoremy. Elementy algebry logiki,

Izdatelstvo nauka, Glavnaja redakcija fiziko.matematiCeskoj literatury. Moscou 1965.

68 Gray, H. J.: Digital Computer Engineering. Englewood Cliffs: Prentice Hall 1963.

500 Bibliography

69 Haas, G.: Design and Operation of Digital Computers. Indianapolis·New York: Howard W. Sams and Co., The Bobbs-Merrill Company 1963.

70 Harrison, M. A.: Introduction to Switching and Automata Teory. New York: McGraw-Hill 1965.

71 Hennie, F. C.: Iterative Arrays of Logical Circuits. New York: MIT Press and J. Wiley 1961.

72 Hill, C. F.: Nor-Nand Logic, Control Engineering, 11, 81-83 (1964). 73 Hohn, F. E.: Applied Boolean Algebra, an Elementary Introduction, New

York: Macmillan 1960. 74 Huffman, D. A.: The Synthesis of Sequential Switching Circuits, Journal of the

Franklin Institute, 257, 161-190 (1954), 275-303 (1954). 75 Huffman, D. A.: The Design and Use of Hazard-free Networks, Journal of the

Association for Computing Machinery, 4, 47-62 (1957). 76 Humprey, W. S.: Switching Circuits with Computer Applications. New York:

McGraw 1958. 77 Hurley, R. B.: Transistor Logic Circuits. New York: John Wiley 1961. 78 Ioanin, G.: Uber die Mindestzustandezahl von Mehrtaktschaltungen, Note.

Institute of Mathematics in Bucharest, 1963. 79 Jauquet, C.: Methodes de synthese de circuits logiques permettant l'emploi

d'elements logiques statiques, Revue A Tijdschrift, No.6 (1959). 80 Kaluznin, L. A.: Sto takoe matematiceskaja logika, Izdatel'stvo nauka, Glav­

naja redakcija fiziko-matematiceskoj literatury, Moscow 1964. 81 Karnaugh, M.: The Map Method of Synthesis of Combinational Logic Circuits,

Communications and Electronics, No.9, 593-599 (1953). 82 Khambata, A. J.: Introduction to Integrated Semi-Conductor Circuits. New

York: John Wiley 1963. 83 Kintner, P. M.: A Simple Method of Designing NOR Logic, Control Engineer­

ing, No.2, 77-81 (1963). 84 Kitov, A. 1., Krinicki, N. A.: Elektronnye cifrovye masiny i programmirovanie,

Gosudarstvennoe izdatel'stvo fiziko-matematiceskoj literatury. Moscow 1961. 85 Kleene, S. C.: Representation of Events in Nerve and Finite Automata, Auto­

mata Studies, Annals of Mathematics Studies, No. 34, 3-41 (1956). 86 Kobrinskii, N. E., Trakhtenbrot, B. A.: Vvedenie v teoriju konecnykh avtoma­

tov, Gosudarstvennoe izdatel'stvo fiziko-matematiceskoj literatury, Moscow 1962.

87 Kuntzman, J.: Algebre de Boole. Paris: Dunod 1965. 88 Kuznecov, O. P.: Predstavlenie reguljarnykh sobytij b asinkhronnykh avto­

matakh, Avtomatika i telemekhanika, Tom XXVI (1965). 89 Lantschoot, E. van: L'algebre logique et son application it la synthese des cir­

cuits combinatoires it relais, Revue A Tijdschrift, No.6 (1959). 90 Lee, C. Y.: Switching Functions on the N-dimensional Cube, Transactions of

the AIEE, Vol. 73, Part I, 289-291 (1954). 91 Lespinard, V., Pernet, R.: Arithmetique. Lyon: Devigne 1962. 92 Lindaman, R., Cohn, M.: Axiomatic Majority Decision Logic, IRE Transaction

on Electronic Computers, Vol. EC-IO, No.1 (1961). 93 Lh'ovschi, L.: Automate finite a elemente logice penumatice si hidraulice,

Monografii asupra teoriei algebrice a mecanismelor automate, Editura Acade­miei Republicii Populare Romine, 1963.

94 Lytel, A.: ABC's of Boolean Algebra. Indianapolis-New York: Howard W. Sams and Co., The Bobbs-Merrill Company 1963.

95 McCluskey, Jr., E. J.: Minimization of Boolean Functions, Bell System Technical Journal, 35,1417-1444 (1956).

Bibliography 501

96 ~McCluskey, Jr., E. J., Bartee, T. C.: A Survey of Switching Circuit Theory. New York: ~IcGraw-Hill1962.

97 McCluskey, Jr., E. J.: Transients in Combinational Logic Circuits, Redundancy Techniques for Computing Systems, pp. 9-46, Spartan Books Co. (1962).

98 McCluskey, Jr., E. J. Schorr, H.: Essential Multiple Output Prime Implicants, Proceedings of the Symposium on the Mathematical Theory of Automata, Poly­technic Press of the Polytechnic Institute of Brooklyn, pp. 437 -457, New York (1962).

99 McCluskey, Jr., E. J.: Introduction to the Theory of Switching. New York: McGraw-Hill 1965.

100 McNaughton, R., Yamada, H.: Regular Expressions and State Graphs for Auto­mata, IRE Transactions on Electronic Computers, Vol. EC-9, 39-47 (1960).

101 McNaughton, R.: The Theory of Automata, a Survey, Advances in Computers, Vol. 2. New York: Academic Press 1961.

102 Marcus, M. P.: Switching Circuits for Engineers. Englewood Cliffs: Prentice Hall 1962.

103 Marcus, M. P.: Relay Essential Hazards, IEEE Transactions on Electronic Computers, EC-12, 405-407 (1963).

104 Marcus, M. P.: Derivation of Maximal Compatibles Using Boolean Algebra, IBM Journal, pp. 537-538 (1964).

105 Mealy, G. H.: A Method for Synthesizing Sequential Circuits, Bell System Technical Journal, 34, 1045-1079 (1955).

106 Miller, R. E.: Switching Theory, Vol. 1: Combinational Circuits, Vol. 2: Sequential Circuits and Machines. New York: John Wiley 1965.

107 Moisil, Gr. C.: Teoria algebrica a mecanismelor automate. Bucharest: 1959. Russian: Algebraiceskaja teorija diskretnykh avtomaticeskikh ustrojstv. Moskow: Izdatelstvo inostrannoj literatury 1963.

108 Moisil, Gr. C.: Functionarea in mai multi timpi a sehemelor eu relee ideale, Editura academiei republicii populare romine, 1960.

109 Moisil, Gr. C.: Lectii asupra teoriei algebrice a mecanismelor automate, Editia III-a, Bucharest 1961.

11 0 M oisil, Gr. C.: Teoria algebrica a circuitelor cu transistori, Curs de au tomatizare industrial a, Tip. B., Edi}ia II-2, V, Probleme speciale, Bucharest 1961.

111 Moisil, Gr. C.: Circuite cu transistori, I, II Monografii asupra teoriei algebrice a mecanismelor automate, Editura academici republicii populare romine I, 1961. II 1962.

112 Moore, E. F.: Gedanken-experiments on Sequential Machines, Automata studies, Annals of Mathematical Studies, No. 34, 129-153, Princeton (1955).

113 Moore, E. F.: Sequential Machines, Selected papers, Reading, Massachusetts: Addison-Wesley 1964.

114 Naslin, P.: Les aleas de continuite dans les circuits de commutation it sequen­ces, Automatisme, No.6, 220-224 (1959).

115 Naslin, P.: Circuits logiques et automatismes it sequences. Paris: Dunod 1965. 116 Netherwood, D. B.: Minimal Sequential Machines, IRE Transactions on Electro­

nic Computers, Vol. EC-S, 367-380 (1959). 117 Nichols, III, A. J.: Multiple Shift Register Realizations of Sequential Machi­

nes, AD 6081 55 (1964). 118 Pelegrin, M.: Machines it calculer electroniques, Application aux automatismes·

Paris: Dunod 1964. 119 Pfeiffer, P. E.: Sets, Events and Switching. New York: McGraw-Hill 1964. 120 Phister, M.: Logical Desigp. of Digital Computers. New York: John Wiley

1958.

502 Bibliography

121 Pichat, E.: Decompositions simples disjointes de fonctions booleennes donnees par leurs composants premiers, R. F. T. I. - Chiffres, Vol. 8,63-66 (1965).

122 Polgar, C.: Technique de i'emploi des relais dans les machines automatiques. Paris: Eyrolles 1964.

123 Pressman, A.1.: Design of Transistorized Circuits for Digital Computers. New York: John Francis Rider 1959. Circuits it transistors pour calculateurs numeriques. Paris: Dunod 1963.

124 Quine, W. V.: The Problem of Simplifying Truth Functions, Am. Math. Monthly, 59,521-531 (1952).

125 Quine, W. V.: A Way to Simplify Truth Functions, Am. Math. Monthly, 62, 627 -631 (1955).

126 Quine, W. V.: On Cores and Prime Implicants of Truth Functions, Am. Math. Monthly, 66,755-760 (1959).

127 Rabin, M. 0., Scott, D.: Finite Automata and Their Decision Problems, IBM Journal of Research and Development, 3, 114-125 (1959).

128 Reza, F. M.: An Introduction to Information Theory. New York: McGraw-Hill 1961.

129 Richalet, J.: Calcul operationnel booleen, L'onde electrique, t. XLIII, 1003 -1021 (1963).

130 Richards, R. K.: Arithmetic Operations in Digital Computers. Princeton: D. Van Nostrand 1955.

131 Roginskij, W. N.: Grundlagen der Struktursynthese von Relaisschaltungen. Munich: R. Oldenbourg 1962 (Tranlated from Elementy strukturnogo sinteza relejnykh skhem upravlenija, Moskow, 1959). Also in English: The Synthesis of Relay Switching Circuits. New York: Van Nostrand 1963.

132 Rosenbloom, P. C.: The Elements of Mathematical Logic. New York: Dover Publications 1950.

133 Roth, J. P.: Minimization Over Boolean Trees, IBM Journal of Research and Development, 4, 543-558 (1960).

134 Rudeanu, S.: Axiomele laticilor ~i ale algebrelor booleene, ~Ionografii asupra teoriei algebrice a mecanismelor automate. Bucharest: Editura academiei republicii populare romine 1963.

135 Russell, A.: Some Binary Codes and a Novel Five-Channel Code, Control, pp 399-404 (1964).

136 Scott, N. R.: Analog and Digital Computer Technology. New York: McGraw­Hill 1960.

137 Shannon, C. E.: The Synthesis of Two-Terminal Switching Circuits, Bell System Technical Journal, 28,59-98 (1949).

138 Shannon, C. E.: A symbolic Analysis of Relay and Switching Circuits, Trans­actions of the AIEE, 57, 713-723 (1938).

139 Siwinski, J.: Uklady przekaznikowe w automatyce, Warsaw, Wydawnictwa Naukowo-Techniczne 1964.

140 Soubies-Camy, H.: Les techniques binaires et Ie traitement de l'information. Paris: Dunod 1961.

141 Spivak, M. A.: Algoritmy abstraktnogo sinteza avtomatov dlja rassirennogo jazyka reguljarnykh vyrazenij, Izvestija akademii nauk SSSR, Tekhniceskaja kibernetika 1,51-57 (1965).

142 Spivak, M. A.: Traktovka teorii automatov metodami teorii otnosenij, Problemy kibernetiki, 12,68-97, Moskow (1964).

143 Susskind, A. K., Haring, D. R., Liu, C. L., Me'[!,ger, K. S.: Synthesis of Sequen­tial Switching Networks, AD 60 88 81, 1964.

Bibliography 503

144 Srejder, Ju. A.: Sto takoe rasstojanie, Gosudarstvennoe izdatel'stvo fiziko­matematiceskoj literatury, Moskow 1963.

145 Stibitz, G. R., Larrivee, J. A.: Mathematics and Computers. New York: McGraw­Hill 1957.

146 Stoll, R. R.: Sets, Logic and Axiomatic Theories. San Francisco: W. H. Freeman and Company 1961.

147 Talantsev, A. D.: Ob analize i sinteze nekotorykh elektriceskikh skhem pri pomosci special'nykh logiceskikh operatorov, Avtomatika i telemekhanika, XX, 898-907 (1959).

148 Tarski, A.: Introduction it la logique. Paris Nauwelaerts Louvain: Gauthier­Villars 1960.

149 Tassinari, A. F.: A Bi-directional Decade Counter with Anticoincidence Net­work and Digital Display, Electronic Engineering, pp. 173-177 (1964).

150 Torng, H. G.: Introduction to the Logical Design of Switching Systems. Reading Massachusetts: Addison-Wesley 1964.

151 Touchais, M.: Les applications techniques de la logique. Paris: Dunod 1956. 152 Traczyk, W.: Elementy i uklady automatyki przekaznikowej, Wydawnictwa

Naukowo-Techniczne, Warsaw 1964_ 153 Trakhtenbrot, B. A.: Algoritmy i masinnoe resenie zadac. Moscou: Gostekhiz­

dat 1957. Also in english: Algorithms and Automatic Computing Machines. Boston: D. C. HeathandCompany, 1963 and infrench: Algorithmes et machines it calculer. Paris: Dunod 1963.

154 Unger, S. H., Paull, M. C.: Minimizing the Number of States in Incompletely Specified Sequential Switching Functions, IRE Transactions on Electronic Computers, Vol. EC-S, 356-366 (1956).

155 Urbano, R. H., Muller, R. K.: A Topological Method for the Determination of the Minimal Forms of a Boolean Function, IRE Transactions on Electronic Computers, Vol. EC-S, 126-132 (1956).

156 Veitch, E. W.: A Chart Method for Simplifying Truth Functions. Proc. ACM, 127-133,2-3 (1952).

157 Vorob'ev, N. N.: Priznaki delimosti. Moscou: Gosudarstvennoe izdatel'stvo fiziko-matematiceskoj literatury 1963.

158 Walker, B. S.: A Control Engineer's Way into Logic, Control, 9, 384-386 (1965). (Part I), 9, 446-448 (1965). (Part II).

159 Weeg, G. P.: Uniqueness of Weighted Code Representation, IRE Transactions on Electronic Computers, Vol. EC-9, 487-490 (1960).

160 Weyh, U.: Elemente der Schaltungsalgebra. Munich: R. Oldenbourg 1961. 161 Whitesitt, J. E.: Boolean Algebra and Its Applications. Reading: Addison­

Wesley 1961. 162 Wilkes, M. V.: Automatic Digital Computers. New York: John Wiley 1956. 163 Wood, P. E.: Hazards in Pulse Sequential Circuits, IEEE Transactions on

Electronic Computers, Vol. EC-13, 151-153 (1964). 164 Young, J. F.: Counters and Shift Registers Using Static Switching Circuits,

Electronic Engineering, 37, 161-163 (1965).

Index

Addition (binary), 25 Adder, 224

serial, 227, 330, 402 parallel, 227

Adjacent, adjacence, 187 Algebra, 2, 18

of Boole, Boolean, 2, 116 of classes, 87 of logic, 87 o regula.r expressions, 456 Sheffer, 161

Alphabet, 341 Analogy, analog, 1 AND (funtion-), 157

AND-INV, 158, 175 NAND, 158, 175

Applicable, 416 Arden, 399 Ashenhurst, 271, 281, 300 Associativity, 87, 88 Asynchronous, 320, 335, 352, 371,374 Aufenkamp, 348 Automaton, 323

Base, 22, 456 Binary

(numeration), 23, 24 (operation), 6 pure, 24 reflected, 50

Boolean, 114, 115, 138

Calculus: propositional, 105 relations, 106

Canonical (form), 131 Carry, 26,227 Cartesian, 8 Characteristic (vector), 128, 140 Checks, 56

parity, 231

Class: equivalence, 14 residual, 17

Code, 44 BCD, 44, 45, 46 bi-quinary, 49 excess, 3 excess E, 49 pure binary, 44 reflected, 50 two-in-five, 48 unit distance, 54

Coding, 2, 47 digital,2 binary, 44 of the internal states, 407, 478

Combinational, 213, 219, 376 Commutativity, 88, 89 Compatible, 418 Complement, 5, 70

(-ation), 6, 120 restricted (to 1), 228 true (to 2), 229

Complete (functionally-set), 174 Computer:

analog, 1 digital,1

Concatenation, 380 Congruence, 14, 15 Constant, 18 Contact, 67 Continuous, 1 Contradiction, 101 Conversion, 24, 29, 30, 43

binary decimal, 34 pure binary-reflected binary, 52, 333 reflected binary-pure binary, 51, 332.

Cost, 246, 406 Counter, 61, 313, 330, 483

decimal, 489 pure binary, 484 reflected binary, 490

Index

Counter-domain, 17 Counting, 10 Cover, 7

closed,420 minimal, 253

Cube n-dimensional, 185

Curtis,271 Cycles, 353, 354 Cyclis,50

Decimal,23 Decomposition:

disjoint, 272 non-disjoint, 300

Definite (-event), 389 Derived, 389 Digit, 25 Dipole, 72 Discontinuous, 2 Discrete, 1,2, 319 Disjunctive (canonical form), 134, 151 Distributivity,89 Division, 28 Domain,17 Dual, duality, dualization, 115

(function), 156 Duodecimal, 23

Element (of a set), 4 Encoder, 54

V-Scan, 235, 333 Excluded middle, 103

Fan-in, fan-out, 221 Field,19 Flip-flop, 309, 329, Function (cf. mapping too)

Boolean, 138, 185 Characteristic, 184 incompletely specified, 183 logic, 97 majority, 173, 174 output, 341 Peirce, 175 propositional, 106 quorum, 173 Sheffer, 175 symmetric, 174 threshold, 172 transition, 341 transmission, 72

Gates, 212 Graph, 17,345 Gray, 50 Group, 19

commutative, 19

Hammer, 161 Hamming, 50, 187, 190 Hazards, 353, 355 Hohn,348 Huffman, 322, 366

Idempotence, 90,119 Implication, 99

reciprocal, 97 Inclusion (relation) 5 Incompatibility, 100 Input, 1, 321 Intersection, 6 Involution, 120 Ioanin,424 Iteration, 381, 382 Ivanescu, 161

Karnaugh,195 k-cube (maximal-), 253 (essential), 254

Kleene, 386

Logic: (-circuit),213 (-al product), 92 (-al sum), 94 (Diode-),216 DCTL,217 DTL,218 functional, 100 propositional, 105

Lukasiewicz, 3

Mapping, 17 bi-univocal, 18 of A into B, 17 of A onto B, 18

Marcus, 426 Matrix, 12

connection-, 348 partition-, 275

Maximal k-cube, 253 Maxterm, 151 McCluskey, 251 Mealy, 322, 345, 400, 465

505

506

Member of a set, 3 Minterm, 147 Modulo, 14

(addition-), 167 Moisil, 3 Moore, 322, 347, 399, 464 ~lorgan (de), 121 Multiplication, 28 Mutually exclusive (-set), 7

n-dimensional cube, 185 Negation, 95

(principle of double-), 102 Non-equivalence, 99, 167 NOR (function-), 101, 158, 175 Numeration, 21

(decimal-),20 (positional-),21

Octal,23 Operation, 19

AND 92 OR-inclusive, 94

OR: (function-), 158 -INV, 158, 175 NOR, 158, 175 exclusive, 97, 167

Ordered pairs, 8 Output, 1, 321

Part, 5 Partitions, 7 Paull, 375, 418, 423 Peirce, 101, 158, Phase, 306, 307, 319, 338, 343, 349 Pichat, 292 Points, 3 Povarov,271 Product, 380

cartesian, 8 fundamental, 134, 147

Proposition, 91 compound, 95

Pseudo-associativity, 165

Quantifier, 107 Quantization, 1 Quine, 251 Quotient, 16

Race, 353, 357, 363 Rank,15 Reflexivity, 13

Index

Reflected, 50 Relays, 67 Relation, 11

binary, 11 equivalence, 13 inclusion, 11 unary, 11 univocal, 17

Remainder, 16 Residual modulo m, 17,57

Separable (function), 272 Sequence, 341 Sequential machine, 323 Sequential network, 303 Set, 3

characteristic, 184 empty, 7 universal, 7

Sexagesimal, 23 Shannon, 131 Sheffer, tOO, 159, 161 Spivak,458 Structure, 18 Subset, 5 Subtraction, 26 Successor, 342 Sum:

fundamental, 134, 151 logical, 94

Switching, 213 Symmetrical, 12 Symmetry, 13 Synchronous, 319, 323, 352, 370,374 Systems:

digital,1 numeration, 21

Tautology, 101 Transitivity, 13 Truth table, 94, 99, 138

Unary operation, 6 Unger, 375, 418, 423 Union, 6 Universe, 7

Vector, 126 Venn (-diagrams), 8, 192

Weight, 24, 46 Word,341 Binary, 5, 44 code, 44