6. SWCT 1965: Ann Arbor, Michigan, USA

6th Annual Symposium on Switching Circuit Theory and Logical Design, Ann Arbor, Michigan, USA, October 6-8, 1965. IEEE Computer Society 1965

Session I

E. P. Stabler:
Threshold gate network synthesis. 5-11
C. L. Coates, Vatana Supornpaibul:
On maximum stability realizations of linearly separable Boolean functions. 12-24
Charles H. Gustafson, Donald R. Haring, Alfred K. Susskind, Thomas G. Wills-Sanford:
Synthesis of counters with threshold elements. 25-35
Sze-Tsen Hu:
Minimal linear decompositions of switching functions. 36-40
R. Gonzalez, Eugene L. Lawler:
Two-level threshold minimization. 41-44

H. Paul Zeiger:
Cascade synthesis of finite-state machines. 45-51
Zvi Kohavi, Edward J. Smith:
Decomposition of sequential machines. 52-61
A. J. Nichols III:
Modular synthesis of sequential machines. 62-70
Wayne A. Davis:
On shift register realizations for sequential machines. 71-83
Janusz A. Brzozowski:
On single-loop realizations of automata. 84-93
Arthur D. Friedman:
Feedback in asynchronous sequential circuits. 94-104

James F. Gimpel:
The synthesis of TANT networks. 105-125
Marion Dunning, Bernard Kolman:
Reliability and fault-masking in n-variable NOR trees. 126-142
C. V. Ramamoorthy:
Procedures for minimization of "exclusive-OR" and "logical-equivalence" switching circuits. 143-149
H. H. Loomis Jr., M. R. McCoy:
A theory of high-speed clocked logic. 150-161
Edward W. Veitch:
A proof concerning infinite nets of logic elements without feedback. 162-167

F. C. Hennie:
Crossing sequences and off-line Turing machine computations. 168-172
S. S. Ruby, Patrick C. Fischer:
Translational methods and computational complexity. 173-178
Richard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II:
Hierarchies of memory limited computations. 179-190
Philip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis:
Memory bounds for recognition of context-free and context-sensitive languages. 191-202
Seymour Ginsburg, Sheila A. Greibach:
Deterministic context free languages. 203-220

Arnold L. Rosenberg:
On multi-head finite automata. 221-228
Jürg Nievergelt:
Partially ordered classes of finite automata. 229-234
Yehoshafat Give'on:
Transparent categories and categories of transition systems. 235-241
Zamir Bavel, David E. Muller:
Reversibility in monadic algebras and automata. 242-247
Eric G. Wagner:
On connecting modules together uniformly to form a modular computer. 248-257
Jack W. Carlyle:
State-calculable stochastic sequential machines, equivalences, and events. 258-263

I. Terris, Michel A. Melkanoff:
Investigation and simulation of a self-repairing digital computer. 264-278
B. R. S. Buckingham, William C. Carter, W. R. Crawford, G. A. Nowell:
The controls automation system. 279-288
F. J. Hackl, R. W. Shirk:
An integrated approach to automated computer maintenance. 289-302
John N. Warfield:
Synthesis of switching circuits to yield prescribed probability relations. 303-309
Parker W. Snapp:
Holiac-A family of student-constructed logic teaching aids. 310-326

Last update Sat May 25 02:54:07 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page