State-Logic Relations for Autonomous Sequential Networks
暂无分享,去创建一个
A new theoretical approach to the description of state-logic relations is presented, which applies to linear as well as nonlinear autonomous networks. A formal link, based on a matrix algorithm, is found between the internal logic of the network and its terminal behavior. The application of matrix algebra is the most attractive and encouraging aspect of this theory, in view of possible systematic minimization procedures.
[1] P. R. Bryant,et al. Nonlinear Feedback Shift Registers , 1962, IRE Trans. Electron. Comput..
[2] M. Stone,et al. The Theory of Representation for Boolean Algebras , 1936 .
[3] Juris Hartmanis,et al. Symbolic Analysis of a Decomposition of Information Processing Machines , 1960, Inf. Control..
[4] B. Elspas,et al. The Theory of Autonomous Linear Sequential Networks , 1959 .
[5] Juris Hartmanis,et al. Loop-Free Structure of Sequential Machines , 1962, Inf. Control..