Abstract is missing.
- Threshold gate network synthesisE. P. Stabler. 5-11
- On maximum stability realizations of linearly separable Boolean functionsC. L. Coates, Vatana Supornpaibul. 12-24
- Synthesis of counters with threshold elementsCharles H. Gustafson, Donald R. Haring, Alfred K. Susskind, Thomas G. Wills-Sanford. 25-35
- Minimal linear decompositions of switching functionsSze-Tsen Hu. 36-40
- Two-level threshold minimizationR. Gonzalez, Eugene L. Lawler. 41-44
- Cascade synthesis of finite-state machinesH. Paul Zeiger. 45-51
- Decomposition of sequential machinesZvi Kohavi, Edward J. Smith. 52-61
- Modular synthesis of sequential machinesA. J. Nichols III. 62-70
- On shift register realizations for sequential machinesWayne A. Davis. 71-83
- On single-loop realizations of automataJanusz A. Brzozowski. 84-93
- Feedback in asynchronous sequential circuitsArthur D. Friedman. 94-104
- The synthesis of TANT networksJames F. Gimpel. 105-125
- Reliability and fault-masking in n-variable NOR treesMarion Dunning, Bernard Kolman. 126-142
- Procedures for minimization of exclusive-OR and logical-equivalence switching circuitsC. V. Ramamoorthy. 143-149
- A theory of high-speed clocked logicH. H. Loomis Jr., M. R. McCoy. 150-161
- A proof concerning infinite nets of logic elements without feedbackEdward W. Veitch. 162-167
- Crossing sequences and off-line Turing machine computationsF. C. Hennie. 168-172
- Translational methods and computational complexityS. S. Ruby, Patrick C. Fischer. 173-178
- Hierarchies of memory limited computationsRichard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II. 179-190
- Memory bounds for recognition of context-free and context-sensitive languagesPhilip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis. 191-202
- Deterministic context free languagesSeymour Ginsburg, Sheila A. Greibach. 203-220
- On multi-head finite automataArnold L. Rosenberg. 221-228
- Partially ordered classes of finite automataJürg Nievergelt. 229-234
- Transparent categories and categories of transition systemsYehoshafat Give on. 235-241
- Reversibility in monadic algebras and automataZamir Bavel, David E. Muller. 242-247
- On connecting modules together uniformly to form a modular computerEric G. Wagner. 248-257
- State-calculable stochastic sequential machines, equivalences, and eventsJack W. Carlyle. 258-263
- Investigation and simulation of a self-repairing digital computerI. Terris, Michel A. Melkanoff. 264-278
- The controls automation systemB. R. S. Buckingham, William C. Carter, W. R. Crawford, G. A. Nowell. 279-288
- An integrated approach to automated computer maintenanceF. J. Hackl, R. W. Shirk. 289-302
- Synthesis of switching circuits to yield prescribed probability relationsJohn N. Warfield. 303-309
- Holiac-A family of student-constructed logic teaching aidsParker W. Snapp. 310-326