Canonical Forms for Information-Lossless Finite-State Logical Machines
IRE Transactions on Circuit TheoryPublished 1 January 1959Open access
David A. Huffman
Citations90
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
"March 25, 1959"--Cover. "Reprinted from the Transactions of the 1959 International Symposium on Circuit and Information Theory."
Keywords
Computer ScienceEngineering
Journal of the Franklin InstituteThe synthesis of sequential switching circuits
466 Citations1954David A. Huffman
An orderly procedure is developed by which the requirements of a sequential switching circuit (one with memory) can be reduced to the requirement of several combinational switching circuits (those without memory).
Journal of the Franklin InstituteThe synthesis of sequential switching circuits
216 Citations1954David A. Huffman
IEEE Transactions on Electronic ComputersSome Properties of Boolean Equations
9 Citations1958N. Rouche
Using finite group theory and the properties of the characteristic equation of the matrix, a classification is introduced for Boolean mappings and their iterations, to which corresponds a classification of sequential machines.
IRE Transactions on Circuit TheoryAnalysis of Bilateral Iterative Networks
9 Citations1959F. C. Hennie
A more general type of one-dimensional iterative network in which the output of each cell may be a function of the inputs of all the cells in the network, both to the left and to the right of the given cell.