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

Report Date:

1966-06-04

Pagination or Media Count:

64.0

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 state-variable and output-variable functions are 2-asumable. The condition of 2-asummability 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 one-level 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 2-asummability.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE