Knowledge (XXG)

Switching circuit theory

Source 📝

226:, can describe the operation of switching circuits. However, Shannon's work has largely overshadowed the other two, and despite some scholars arguing the similarities of Nakashima's work to Shannon's, their approaches and theoretical frameworks were markedly different. Also implausible is that Shestakov's influenced the other two due to the language barriers and the relative obscurity of his work abroad. Furthermore, Shannon and Shestakov defended their theses the same year in 1938, and Shestakov did not publish until 1941. 33: 229:
Ideal switches are considered as having only two exclusive states, for example, open or closed. In some analysis, the state of a switch can be considered to have no influence on the output of the system and is designated as a "don't care" state. In complex networks it is necessary to also account for
720: 742: 100:, where the present state depends on the present state and past states; in that sense, sequential circuits are said to include "memory" of past states. An important class of sequential circuits are 104:. Switching circuit theory is applicable to the design of telephone systems, computers, and similar systems. Switching circuit theory provided the mathematical foundations and tools for 689:
Although the possibility of establishing a switching theory was recognized by M. Boda as early as in the 19th century, the first important works on this subject were published by
970: 428: 1296: 476: 1528: 1071: 835: 751: 857: 632: 630: 628: 626: 624: 622: 620: 467: 1566: 230:
the finite switching time of physical switches; where two or more different paths in a network may affect the output, these delays may result in a
1468: 1143: 886: 1571: 277: 1242: 783: 598: 567: 397: 1403: 54: 1170: 510: 455: 322: 434: 1516: 1415: 380: 1450: 1289: 1036: 674: 528: 76: 1176:. Tampere International Center for Signal Processing (TICSP) Series. Tampere University of Technology / TTKK, Monistamo, Finland. 618:(in German). Neue Folge XXXV (1–7). Wiesbaden, Germany: C. W. Kreidel's Verlag: 1–7, 29–34, 49–53, 71–75, 91–95, 111–115, 133–138. 1104: 946: 890: 389: 1132:. Version IV. Functional Decomposition Group, Department of Electrical Engineering, Portland University, Portland, Oregon, USA. 616:
Organ für die Fortschritte des Eisenbahnwesens in technischer Beziehung – Fachblatt des Vereins deutscher Eisenbahn-Verwaltungen
1462: 1398: 382:
Reprints from the Early Days of Information Sciences: TICSP Series on the Contributions of Akira Nakashima to Switching Theory
1026: 179: 333: 1588: 1456: 1063: 327: 1741: 1282: 115:
described how logical operations could be carried out by electrical switching circuits. During 1880–1881 he showed that
1731: 1705: 1600: 267: 223: 47: 41: 1620: 1578: 808: 796: 559: 1736: 1521: 1506: 1432: 1392: 1123:
Perkowski, Marek A.; Grygiel, Stanislaw (1995-11-20). "6. Historical Overview of the Research on Decomposition".
1097: 317: 989: 805:
Some mathematical methods for the construction and simplification of two-terminal electrical networks of class A
58: 1438: 1426: 614:
Boda, Martin (1898). "Die Schaltungstheorie der Blockwerke" [The switching theory of block systems].
92:
is the mathematical study of the properties of networks of idealized switches. Such networks may be strictly
1583: 1361: 1356: 666: 151: 96:, in which their output state is only a function of the present state of their inputs; or may also contain 1677: 1474: 1133: 928: 505: 446: 112: 658: 1689: 1643: 1511: 1409: 1346: 1089: 823: 737: 694: 272: 262: 1225:. Studies in Computational Intelligence. Vol. 335 (1 ed.). Berlin & Heidelberg, Germany: 1124: 1212: 1162: 911: 635: 372: 1615: 1610: 1593: 1313: 1067: 839: 801:Некоторые математические методы кон-струирования и упрощения двухполюсных электрических схем класса А 297: 1662: 1605: 1444: 1366: 1341: 1305: 1138: 933: 463: 188: 170: 105: 93: 1682: 1548: 1386: 1351: 1185: 964: 938: 773: 634:(NB. This series of seven articles was republished in a 91-pages book in 1899 with a foreword by 590: 422: 292: 518: 1216: 1166: 915: 376: 1638: 1256: 1248: 1238: 1177: 1110: 1100: 1032: 680: 670: 594: 584: 563: 524: 403: 393: 252: 247: 1193: 238:" where the output state changes due to the different propagation times through the network. 1371: 1230: 1222:
From Boolean Logic to Switching Circuits and Automata: Towards Modern Information Technology
1001: 847: 763: 755: 553: 485: 257: 219: 128: 97: 1083: 1057: 1561: 1556: 1538: 1501: 1496: 1421: 1381: 1226: 1005: 710: 690: 411: 344: 282: 211: 640: 843: 1491: 1022: 990:"Prehistory of Switching Theory in Japan: Akira Nakashima and His Relay-circuit Theory" 450: 349: 235: 231: 215: 132: 919: 878: 1725: 1672: 1655: 1650: 200: 184: 166: 162: 101: 1189: 942: 777: 490: 388:. Tampere International Center for Signal Processing (TICSP) Series. Vol. 40. 307: 302: 127:, but this work remained unpublished until 1933. The first published proof was by 1220: 17: 759: 196: 192: 174: 158: 136: 665:(1 ed.). Binghamton, New York, USA: Litton Educational Publishing, Inc. / 1710: 1376: 1321: 1234: 312: 124: 120: 1252: 1181: 1171:"Publications in the First Twenty Years of Switching Theory and Logic Design" 879:"Switching Theory/Relay Circuit Network Theory/Theory of Logical Mathematics" 407: 222:
in the Soviet Union. The three published a series of papers showing that the
1667: 1336: 852: 719:(NB. Translation of an article which originally appeared in Japanese in the 287: 116: 1331: 1326: 768: 1274: 721:
Journal of the Institute of Telegraph and Telephone Engineers of Japan
330:– computer software mimics relay circuits for industrial applications 1260: 1056:
Keister, William; Ritchie, Alistair E.; Washburn, Seth H. (1951).
338: 199:
designed and built electromechanical logic gates for his computer
684: 1278: 1114: 740:(1938). "A Symbolic Analysis of Relay and Switching Circuits". 743:
Transactions of the American Institute of Electrical Engineers
207: 206:
The theory was independently established through the works of
195:
in physics, for the first modern electronic AND gate in 1924.
26: 1096:. 5th printing September 1963 (1st ed.). New York, USA: 927:. Niš, Serbia; Tampere, Finland; Boston, Massachusetts, USA. 782:(NB. Based on Shannon's master thesis of the same title at 131:
in 1913, so the NAND logical operation is sometimes called
1092:(1958-12-01) . Written at Watertown, Massachusetts, USA. 523:. Vol. 4 (reprint ed.). 1989. pp. 218–221. 123:) can be used to reproduce the functions of all the other 1219:(2011). Written at Niš, Serbia & Tampere, Finland. 1062:. The Bell Telephone Laboratories Series (1 ed.). 367: 365: 150:
In 1898, Martin Boda described a switching theory for
663:
Introduction to the Methodology of Switching Circuits
1698: 1631: 1547: 1484: 1312: 713:(May 1936). "Theory of Relay Circuit Composition". 824:"History of Research on Switching Theory in Japan" 143:. Consequently, these gates are sometimes called 108:design in almost all areas of modern technology. 1126:A Survey of Literature on Function Decomposition 661:(May 1972). "Reference Notations to Chapter 1". 508:(1933) . "A Boolian Algebra with One Constant". 828:IEEJ Transactions on Fundamentals and Materials 552:Kleine Büning, Hans; Lettmann, Theodor (1999). 1290: 555:Propositional logic: deduction and algorithms 477:Bulletin of the American Mathematical Society 8: 514:(manuscript). Vol. 4. paragraphs 12–20. 921:Some Historical Remarks on Switching Theory 715:Nippon Electrical Communication Engineering 653: 651: 539:The Existential Graphs of Charles S. Peirce 1297: 1283: 1275: 1028:The Algebraic Theory of Switching Circuits 969:: CS1 maint: location missing publisher ( 836:Institute of Electrical Engineers of Japan 752:American Institute of Electrical Engineers 427:: CS1 maint: location missing publisher ( 1137: 932: 851: 767: 489: 77:Learn how and when to remove this message 40:This article includes a list of general 1469:Application-specific integrated circuit 887:Information Processing Society of Japan 361: 1017: 1015: 962: 420: 278:Number One Electronic Switching System 161:replaced relays for logic operations. 1094:Switching Circuits and Logical Design 1006:10.34336/historiascientiarum.29.1_136 983: 981: 784:Massachusetts Institute of Technology 7: 1404:Three-dimensional integrated circuit 1031:. Pergamon Press. pp. 12, 17. 323:Nonblocking minimal spanning switch 173:introduced a version of the 16-row 1416:Erasable programmable logic device 46:it lacks sufficient corresponding 25: 1451:Complex programmable logic device 807:] (PhD thesis) (in Russian). 165:'s modification, in 1907, of the 1059:The Design of Switching Circuits 459:. Vol. 5. pp. 421–423. 390:Tampere University of Technology 31: 1463:Field-programmable object array 1399:Mixed-signal integrated circuit 1149:from the original on 2021-03-28 1074:from the original on 2020-05-09 952:from the original on 2022-10-25 893:from the original on 2021-03-22 860:from the original on 2022-07-10 491:10.1090/S0002-9904-1978-14533-9 470:The new elements of mathematics 341:– an early kind of logic device 180:Tractatus Logico-Philosophicus 1: 1589:Hardware description language 1457:Field-programmable gate array 1064:D. Van Nostrand Company, Inc. 918:; Karpovsky, Mark G. (2007). 797:Shestakov , Victor Ivanovich 520:Writings of Charles S. Peirce 456:Writings of Charles S. Peirce 328:Programmable logic controller 169:can be used as a logic gate. 697:shortly before World War II. 468:"Review: Charles S. Peirce, 449:(1993) . "Letter, Peirce to 1601:Formal equivalence checking 760:10.1109/T-AIEE.1938.5057767 687:. C4463-000-3. p. 19: 268:Network switching subsystem 1758: 1621:Hierarchical state machine 1579:Transaction-level modeling 1098:John Wiley & Sons Inc. 822:Yamada , Akihiko (2004). 809:Lomonosov State University 560:Cambridge University Press 224:two-valued Boolean algebra 218:in the United States, and 1522:Digital signal processing 1507:Logic in computer science 1433:Programmable logic device 1393:Hybrid integrated circuit 1235:10.1007/978-3-642-11682-7 723:(JITTEJ) September 1935, 334:Quine–McCluskey algorithm 318:Logic in computer science 1534:Switching circuit theory 1439:Programmable Array Logic 1427:Programmable logic array 988:Kawanishi, Toma (2019). 800: 537:Roberts, Don D. (2009). 177:as proposition 5.101 of 152:signalling block systems 90:Switching circuit theory 1584:Register-transfer level 853:10.1541/ieejfms.124.720 667:D. van Nostrand Company 586:Engineering mathematics 533:. ark:/13960/t11p5r61f. 506:Peirce, Charles Sanders 447:Peirce, Charles Sanders 191:, got part of the 1954 61:more precise citations. 1475:Tensor Processing Unit 1090:Caldwell, Samuel Hawks 738:Shannon, Claude Elwood 113:Charles Sanders Peirce 1690:Electronic literature 1644:Hardware acceleration 1512:Computer architecture 1410:Emitter-coupled logic 1347:Printed circuit board 1213:Stanković, Radomir S. 1192:. #14. Archived from 1163:Stanković, Radomir S. 912:Stanković, Radomir S. 373:Stanković, Radomir S. 273:5ESS Switching System 263:Fast packet switching 203:(from 1935 to 1938). 145:universal logic gates 1616:Finite-state machine 1594:High-level synthesis 1529:Circuit minimization 1217:Astola, Jaakko Tapio 1167:Astola, Jaakko Tapio 994:Historia Scientiarum 916:Astola, Jaakko Tapio 883:IPSJ Computer Museum 464:Burks, Arthur Walter 392:, Tampere, Finland. 377:Astola, Jaakko Tapio 298:Circuit minimization 139:is sometimes called 1742:Digital electronics 1663:Digital photography 1445:Generic Array Logic 1367:Combinational logic 1342:Printed electronics 1306:Digital electronics 844:2004IJTFM.124..720Y 583:Bird, John (2007). 189:coincidence circuit 171:Ludwig Wittgenstein 111:In an 1886 letter, 98:sequential elements 94:combinational logic 1732:Circuit complexity 1611:Asynchronous logic 1387:Integrated circuit 1352:Electronic circuit 1165:; Sasao, Tsutomu; 1085:(2+xx+556+2 pages) 293:Circuit complexity 187:, inventor of the 119:(or alternatively 1719: 1718: 1668:Digital telephone 1639:Computer hardware 1606:Synchronous logic 1271:(xviii+212 pages) 1244:978-3-642-11681-0 1119:(xviii+686 pages) 996:. Second Series. 754:(AIEE): 713–723. 700:(xvi+573+1 pages) 659:Klir, George Jiří 600:978-0-7506-8555-9 569:978-0-521-63017-7 399:978-952-15-1980-2 253:Message switching 248:Circuit switching 87: 86: 79: 18:Switching circuit 16:(Redirected from 1749: 1737:Digital circuits 1372:Sequential logic 1299: 1292: 1285: 1276: 1270: 1268: 1267: 1207: 1205: 1204: 1198: 1175: 1157: 1155: 1154: 1148: 1141: 1131: 1118: 1082: 1080: 1079: 1043: 1042: 1019: 1010: 1009: 985: 976: 974: 968: 960: 958: 957: 951: 936: 926: 908: 902: 901: 899: 898: 875: 869: 868: 866: 865: 855: 819: 813: 812: 793: 787: 781: 771: 734: 728: 718: 711:Nakashima, Akira 707: 701: 699: 655: 646: 644: 636:Georg Barkhausen 619: 611: 605: 604: 580: 574: 573: 549: 543: 542: 534: 515: 511:Collected Papers 502: 496: 495: 493: 460: 443: 437: 433:(3+207+1 pages) 432: 426: 418: 416: 410:. Archived from 387: 369: 258:Packet switching 220:Victor Shestakov 129:Henry M. Sheffer 121:NAND gates alone 82: 75: 71: 68: 62: 57:this article by 48:inline citations 35: 34: 27: 21: 1757: 1756: 1752: 1751: 1750: 1748: 1747: 1746: 1722: 1721: 1720: 1715: 1694: 1627: 1562:Place and route 1557:Logic synthesis 1543: 1539:Gate equivalent 1502:Logic synthesis 1497:Boolean algebra 1480: 1422:Macrocell array 1382:Boolean circuit 1308: 1303: 1265: 1263: 1245: 1227:Springer-Verlag 1211: 1202: 1200: 1196: 1173: 1169:(August 2001). 1161: 1152: 1150: 1146: 1129: 1122: 1107: 1088: 1077: 1075: 1055: 1052: 1050:Further reading 1047: 1046: 1039: 1021: 1020: 1013: 987: 986: 979: 961: 955: 953: 949: 924: 910: 909: 905: 896: 894: 877: 876: 872: 863: 861: 821: 820: 816: 802: 795: 794: 790: 736: 735: 731: 709: 708: 704: 677: 657: 656: 649: 638: 613: 612: 608: 601: 593:. p. 532. 582: 581: 577: 570: 551: 550: 546: 536: 531: 517: 504: 503: 499: 484:(5): 913–918 . 462: 445: 444: 440: 419: 414: 400: 385: 379:, eds. (2008). 371: 370: 363: 358: 345:Switching lemma 283:Boolean circuit 244: 212:Akira Nakashima 117:NOR gates alone 83: 72: 66: 63: 53:Please help to 52: 36: 32: 23: 22: 15: 12: 11: 5: 1755: 1753: 1745: 1744: 1739: 1734: 1724: 1723: 1717: 1716: 1714: 1713: 1708: 1702: 1700: 1696: 1695: 1693: 1692: 1687: 1686: 1685: 1680: 1678:cinematography 1670: 1665: 1660: 1659: 1658: 1648: 1647: 1646: 1635: 1633: 1629: 1628: 1626: 1625: 1624: 1623: 1613: 1608: 1603: 1598: 1597: 1596: 1591: 1581: 1576: 1575: 1574: 1569: 1559: 1553: 1551: 1545: 1544: 1542: 1541: 1536: 1531: 1526: 1525: 1524: 1517:Digital signal 1514: 1509: 1504: 1499: 1494: 1492:Digital signal 1488: 1486: 1482: 1481: 1479: 1478: 1472: 1466: 1460: 1454: 1448: 1442: 1436: 1430: 1424: 1419: 1413: 1407: 1401: 1396: 1390: 1384: 1379: 1374: 1369: 1364: 1359: 1354: 1349: 1344: 1339: 1334: 1329: 1324: 1318: 1316: 1310: 1309: 1304: 1302: 1301: 1294: 1287: 1279: 1273: 1272: 1243: 1209: 1159: 1139:10.1.1.64.1129 1120: 1105: 1086: 1051: 1048: 1045: 1044: 1037: 1023:Moisil, GR. C. 1011: 1000:(1): 136–162. 977: 934:10.1.1.66.1248 903: 870: 814: 788: 729: 702: 675: 669:. p. 19. 647: 606: 599: 575: 568: 544: 541:. p. 131. 529: 497: 438: 417:on 2021-03-08. 398: 360: 359: 357: 354: 353: 352: 350:Unate function 347: 342: 336: 331: 325: 320: 315: 310: 305: 300: 295: 290: 285: 280: 275: 270: 265: 260: 255: 250: 243: 240: 236:race condition 232:"logic hazard" 216:Claude Shannon 141:Peirce's arrow 133:Sheffer stroke 106:digital system 102:state machines 85: 84: 39: 37: 30: 24: 14: 13: 10: 9: 6: 4: 3: 2: 1754: 1743: 1740: 1738: 1735: 1733: 1730: 1729: 1727: 1712: 1709: 1707: 1706:Metastability 1704: 1703: 1701: 1699:Design issues 1697: 1691: 1688: 1684: 1681: 1679: 1676: 1675: 1674: 1673:Digital video 1671: 1669: 1666: 1664: 1661: 1657: 1654: 1653: 1652: 1651:Digital audio 1649: 1645: 1642: 1641: 1640: 1637: 1636: 1634: 1630: 1622: 1619: 1618: 1617: 1614: 1612: 1609: 1607: 1604: 1602: 1599: 1595: 1592: 1590: 1587: 1586: 1585: 1582: 1580: 1577: 1573: 1570: 1568: 1565: 1564: 1563: 1560: 1558: 1555: 1554: 1552: 1550: 1546: 1540: 1537: 1535: 1532: 1530: 1527: 1523: 1520: 1519: 1518: 1515: 1513: 1510: 1508: 1505: 1503: 1500: 1498: 1495: 1493: 1490: 1489: 1487: 1483: 1476: 1473: 1470: 1467: 1464: 1461: 1458: 1455: 1452: 1449: 1446: 1443: 1440: 1437: 1434: 1431: 1428: 1425: 1423: 1420: 1417: 1414: 1411: 1408: 1405: 1402: 1400: 1397: 1394: 1391: 1388: 1385: 1383: 1380: 1378: 1375: 1373: 1370: 1368: 1365: 1363: 1360: 1358: 1355: 1353: 1350: 1348: 1345: 1343: 1340: 1338: 1335: 1333: 1330: 1328: 1325: 1323: 1320: 1319: 1317: 1315: 1311: 1307: 1300: 1295: 1293: 1288: 1286: 1281: 1280: 1277: 1262: 1258: 1254: 1250: 1246: 1240: 1236: 1232: 1228: 1224: 1223: 1218: 1214: 1210: 1199:on 2017-08-09 1195: 1191: 1187: 1183: 1179: 1172: 1168: 1164: 1160: 1145: 1140: 1135: 1128: 1127: 1121: 1116: 1112: 1108: 1102: 1099: 1095: 1091: 1087: 1084: 1073: 1069: 1065: 1061: 1060: 1054: 1053: 1049: 1040: 1038:9781483160764 1034: 1030: 1029: 1024: 1018: 1016: 1012: 1007: 1003: 999: 995: 991: 984: 982: 978: 972: 966: 948: 944: 940: 935: 930: 923: 922: 917: 913: 907: 904: 892: 888: 884: 880: 874: 871: 859: 854: 849: 845: 841: 837: 833: 829: 825: 818: 815: 810: 806: 798: 792: 789: 785: 779: 775: 770: 765: 761: 757: 753: 749: 745: 744: 739: 733: 730: 726: 722: 717:(3): 197–226. 716: 712: 706: 703: 698: 696: 695:C. E. Shannon 692: 686: 682: 678: 676:0-442-24463-0 672: 668: 664: 660: 654: 652: 648: 642: 637: 633: 631: 629: 627: 625: 623: 621: 617: 610: 607: 602: 596: 592: 588: 587: 579: 576: 571: 565: 562:. p. 2. 561: 557: 556: 548: 545: 540: 532: 530:9780253372017 526: 522: 521: 516:Reprinted in 513: 512: 507: 501: 498: 492: 487: 483: 479: 478: 473: 471: 465: 458: 457: 452: 448: 442: 439: 436: 430: 424: 413: 409: 405: 401: 395: 391: 384: 383: 378: 374: 368: 366: 362: 355: 351: 348: 346: 343: 340: 337: 335: 332: 329: 326: 324: 321: 319: 316: 314: 311: 309: 306: 304: 301: 299: 296: 294: 291: 289: 286: 284: 281: 279: 276: 274: 271: 269: 266: 264: 261: 259: 256: 254: 251: 249: 246: 245: 241: 239: 237: 233: 227: 225: 221: 217: 213: 209: 204: 202: 198: 194: 190: 186: 185:Walther Bothe 182: 181: 176: 172: 168: 167:Fleming valve 164: 163:Lee De Forest 160: 155: 153: 148: 146: 142: 138: 134: 130: 126: 122: 118: 114: 109: 107: 103: 99: 95: 91: 81: 78: 70: 67:November 2014 60: 56: 50: 49: 43: 38: 29: 28: 19: 1632:Applications 1533: 1264:. Retrieved 1221: 1208:(4+60 pages) 1201:. Retrieved 1194:the original 1151:. Retrieved 1125: 1106:0-47112969-0 1093: 1076:. Retrieved 1058: 1027: 997: 993: 954:. Retrieved 920: 906: 895:. Retrieved 882: 873: 862:. Retrieved 831: 827: 817: 804: 791: 769:1721.1/11173 747: 741: 732: 724: 714: 705: 691:A. Nakashima 688: 662: 615: 609: 585: 578: 554: 547: 538: 519: 509: 500: 481: 475: 469: 454: 441: 412:the original 381: 308:Logic design 303:Karnaugh map 228: 205: 178: 159:vacuum tubes 157:Eventually, 156: 149: 144: 140: 110: 89: 88: 73: 64: 45: 1362:Memory cell 1158:(188 pages) 838:: 720–726. 639: [ 451:A. Marquand 197:Konrad Zuse 193:Nobel Prize 175:truth table 137:logical NOR 125:logic gates 59:introducing 1726:Categories 1711:Runt pulse 1683:television 1377:Logic gate 1322:Transistor 1314:Components 1266:2022-10-25 1261:2011921126 1203:2021-03-28 1153:2021-03-28 1078:2020-05-09 956:2022-10-25 897:2021-03-28 864:2022-10-26 535:See also: 480:(review). 461:See also: 356:References 313:Logic gate 214:in Japan, 42:references 1567:Placement 1357:Flip-flop 1337:Capacitor 1253:1860-949X 1182:1456-2774 1134:CiteSeerX 975:(8 pages) 965:cite book 929:CiteSeerX 799:(1938). 786:in 1937.) 727:731–752.) 685:72-181095 435:10:00 min 423:cite book 408:1456-2774 288:C-element 210:engineer 1332:Inductor 1327:Resistor 1190:62319288 1144:Archived 1072:Archived 1066:p.  1025:(1969). 947:Archived 943:10029339 891:Archived 889:. 2012. 858:Archived 778:51638483 466:(1978). 242:See also 183:(1921). 1572:Routing 1406:(3D IC) 1115:58-7896 840:Bibcode 55:improve 1549:Design 1485:Theory 1471:(ASIC) 1465:(FPOA) 1459:(FPGA) 1453:(CPLD) 1418:(EPLD) 1259:  1251:  1241:  1188:  1180:  1136:  1113:  1103:  1035:  941:  931:  776:  750:(12). 683:  673:  597:  591:Newnes 566:  527:  406:  396:  135:; the 44:, but 1656:radio 1477:(TPU) 1447:(GAL) 1441:(PAL) 1435:(PLD) 1429:(PLA) 1412:(ECL) 1395:(HIC) 1197:(PDF) 1186:S2CID 1174:(PDF) 1147:(PDF) 1130:(PDF) 950:(PDF) 939:S2CID 925:(PDF) 834:(8). 803:[ 774:S2CID 643:] 415:(PDF) 386:(PDF) 339:Relay 1389:(IC) 1257:LCCN 1249:ISSN 1239:ISBN 1178:ISSN 1111:LCCN 1101:ISBN 1033:ISBN 971:link 693:and 681:LCCN 671:ISBN 595:ISBN 564:ISBN 525:ISBN 429:link 404:ISSN 394:ISBN 234:or " 1231:doi 1068:147 1002:doi 848:doi 832:124 764:hdl 756:doi 725:150 486:doi 453:". 208:NEC 1728:: 1255:. 1247:. 1237:. 1229:. 1215:; 1184:. 1142:. 1109:. 1070:. 1014:^ 998:29 992:. 980:^ 967:}} 963:{{ 945:. 937:. 914:; 885:. 881:. 856:. 846:. 830:. 826:. 772:. 762:. 748:57 746:. 679:. 650:^ 645:.) 641:de 589:. 558:. 482:84 474:. 425:}} 421:{{ 402:. 375:; 364:^ 201:Z1 154:. 147:. 1298:e 1291:t 1284:v 1269:. 1233:: 1206:. 1156:. 1117:. 1081:. 1041:. 1008:. 1004:: 973:) 959:. 900:. 867:. 850:: 842:: 811:. 780:. 766:: 758:: 603:. 572:. 494:. 488:: 472:" 431:) 80:) 74:( 69:) 65:( 51:. 20:)

Index

Switching circuit
references
inline citations
improve
introducing
Learn how and when to remove this message
combinational logic
sequential elements
state machines
digital system
Charles Sanders Peirce
NOR gates alone
NAND gates alone
logic gates
Henry M. Sheffer
Sheffer stroke
logical NOR
signalling block systems
vacuum tubes
Lee De Forest
Fleming valve
Ludwig Wittgenstein
truth table
Tractatus Logico-Philosophicus
Walther Bothe
coincidence circuit
Nobel Prize
Konrad Zuse
Z1
NEC

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.