5. FOCS 1964

• David Hammel: Ideas on asynchronous feedback networks. 4-11 BibTeX
• Robert E. Swartwout: New techniques for designing speed independent control logic. 12-29 BibTeX
• Jack Goldberg, Robert A. Short: Antiparallel control logic. 30-43 BibTeX
• Michael A. Harrison: A census of finite automata (extended summary). 44-46 BibTeX
• Thomas V. Griffiths: Turing machine recognizers for general rewriting systems. 47-56 BibTeX
• Seymour Ginsburg, Edwin H. Spanier: Mappings of languages by two-tape devices. 57-67 BibTeX
• Patrick C. Fischer: On formalisms for Turing machines. 68-75 BibTeX
• Arnold L. Rosenberg: On n-tape finite state acceptors. 76-81 BibTeX
• Juris Hartmanis, Richard Edwin Stearns: Computational complexity of recursive sequences. 82-90 BibTeX
• Milton W. Green: A lower bound on Rado's sigma function for binary Turing machines. 91-94 BibTeX
• F. C. Hennie: Fault detecting experiments for sequential circuits. 95-110 BibTeX
• Edward B. Eichelberger: Hazard detection in combinational and sequential switching circuits. 111-120 BibTeX
• J. F. Poage, Edward J. McCluskey: Derivation of optimum test sequences for sequential machines. 121-132 BibTeX
• Bernard Elspas: Topological constraints on interconnection-limited logic. 133-137 BibTeX
• Rocco H. Urbano: Some new results on the analysis and reliability of large polyfunctional nets. 138-148 BibTeX
• G. L. Hicks, Arthur J. Bernstein: On the minimum stage realization of switching functions using logic gates with limited fan-in. 149-155 BibTeX
• Arthur J. Bernstein: Reducing variable dependency in combinational circuits. 156-164 BibTeX
• Sheldon B. Akers Jr.: A diagrammatic approach to multi-level logic synthesis. 165-173 BibTeX
• R. Stockton Gaines: Implication techniques for Boolean functions. 174-182 BibTeX
• James F. Gimpel: A reduction technique for prime implicant tables. 183-191 BibTeX
• Richard Edwin Stearns, Juris Hartmanis: On the application of pair algebra to automata theory. 192-196 BibTeX
• Wayne A. Davis, Janusz A. Brzozowski: On the linearity of sequential machines. 197-208 BibTeX
• C. L. Liu: Sequential-machine realization using feedback shift registers. 209-227 BibTeX
• D. L. Epley, P. T. Wang: On state assignments and sequential machine decompositions from S. P. partitions. 228-233 BibTeX
• Zamir Bavel: On the total length of an experiment, I. 234-248 BibTeX