5. SWCT 1964: Princeton, New Jersey, USA

5th Annual Symposium on Switching Circuit Theory and Logical Design, Princeton, New Jersey, USA, November 11-13, 1964. IEEE Computer Society 1964

Session I

David Hammel:
Ideas on asynchronous feedback networks. 4-11
Robert E. Swartwout:
New techniques for designing speed independent control logic. 12-29
Jack Goldberg, Robert A. Short:
Antiparallel control logic. 30-43
Michael A. Harrison:
A census of finite automata (extended summary). 44-46

Thomas V. Griffiths:
Turing machine recognizers for general rewriting systems. 47-56
Seymour Ginsburg, Edwin H. Spanier:
Mappings of languages by two-tape devices. 57-67
Patrick C. Fischer:
On formalisms for Turing machines. 68-75
Arnold L. Rosenberg:
On n-tape finite state acceptors. 76-81
Juris Hartmanis, Richard Edwin Stearns:
Computational complexity of recursive sequences. 82-90
Milton W. Green:
A lower bound on Rado's sigma function for binary Turing machines. 91-94

F. C. Hennie:
Fault detecting experiments for sequential circuits. 95-110
Edward B. Eichelberger:
Hazard detection in combinational and sequential switching circuits. 111-120
J. F. Poage, Edward J. McCluskey:
Derivation of optimum test sequences for sequential machines. 121-132
Bernard Elspas:
Topological constraints on interconnection-limited logic. 133-137
Rocco H. Urbano:
Some new results on the analysis and reliability of large polyfunctional nets. 138-148

G. L. Hicks, Arthur J. Bernstein:
On the minimum stage realization of switching functions using logic gates with limited fan-in. 149-155
Arthur J. Bernstein:
Reducing variable dependency in combinational circuits. 156-164
Sheldon B. Akers Jr.:
A diagrammatic approach to multi-level logic synthesis. 165-173
R. Stockton Gaines:
Implication techniques for Boolean functions. 174-182
James F. Gimpel:
A reduction technique for prime implicant tables. 183-191

Richard Edwin Stearns, Juris Hartmanis:
On the application of pair algebra to automata theory. 192-196
Wayne A. Davis, Janusz A. Brzozowski:
On the linearity of sequential machines. 197-208
C. L. Liu:
Sequential-machine realization using feedback shift registers. 209-227
D. L. Epley, P. T. Wang:
On state assignments and sequential machine decompositions from S. P. partitions. 228-233
Zamir Bavel:
On the total length of an experiment, I. 234-248

Last update Fri May 25 08:14:14 2012 CET by the DBLP Team —

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