Sequential Functions and Linear Sequential Machines
- 1 June 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-14 (3) , 376-382
- https://doi.org/10.1109/pgec.1965.264143
Abstract
The``state'' of a sequential machine is interpreted as the sequence-to-sequence input-output mapping performed by the machine. Such mappings have been called sequential functions. This concept of state is applied to the theory of binary linear sequential machines. The modulo-2 adders are assumed to have an inherent delay td≥0, and the effects of initial conditions are considered. The pertinent results from the algebra of delay polynomials are summarized, and the state structure of linear sequential functions is outlined. It is shown that every retrospective linear sequential function can be realized using only unit-delay modulo-2 adders, and bounds are derived on the minimum realizable delay between input and output.Keywords
This publication has 5 references indexed in Scilit:
- States of sequential machines whose logical elements involve delayPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1962
- On periodicity of states in linear modular sequential circuits (Corresp.)IRE Transactions on Information Theory, 1959
- The Theory of Autonomous Linear Sequential NetworksIRE Transactions on Circuit Theory, 1959
- Linear Multivalued Sequential Coding NetworksIRE Transactions on Circuit Theory, 1959
- Sequential FunctionsJournal of the ACM, 1958