
Accession Number : AD0485579
Title : REALIZATION OF SEQUENTIAL MACHINES WITH THRESHOLD ELEMENTS.
Descriptive Note : Technical rept.,
Corporate Author : TEXAS UNIV AT AUSTIN LABS FOR ELECTRONICS AND RELATED SCIENCE RESEARCH
Personal Author(s) : Hadlock, Frank Owen ; Coates, Clarence L.
Report Date : 04 JUN 1966
Pagination or Media Count : 64
Abstract : This paper presents an algorithm which, given a sequential machine with completely specified state and output tables, yields all code assignments for which the statevariable and outputvariable functions are 2asumable. The condition of 2asummability is a necessary one for linear separability. (It is also sufficient for functions of less than eight variables). Hence, the code assignments for which the corresponding threshold gate realizations are onelevel are contained in the set obtained in the algorithm. This paper first concerns itself with making some definitions relevant to the three concepts underlying the condition of 2asummability.
Descriptors : (*COMPUTER LOGIC, SWITCHING CIRCUITS), (*GRAPHICS, AUTOMATA), ALGEBRAIC TOPOLOGY, ALGORITHMS, FUNCTIONS(MATHEMATICS), CODING, SET THEORY.
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE