|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| K.L. Doty, H. Frank, "Discrete-Time Systems with the Decomposition Property," IEEE Transactions on Computers, vol. 19, no. 5, pp. 412-420, May, 1970. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.222939, author = {K.L. Doty and H. Frank}, title = {Discrete-Time Systems with the Decomposition Property}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {5}, issn = {0018-9340}, year = {1970}, pages = {412-420}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.222939}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Discrete-Time Systems with the Decomposition Property IS - 5 SN - 0018-9340 SP412 EP420 EPD - 412-420 A1 - K.L. Doty, A1 - H. Frank, PY - 1970 KW - Decomposition property KW - discrete-time systems KW - finite-memory systems KW - linear KW - sequential machines. VL - 19 JA - IEEE Transactions on Computers ER - | |||
The decomposition property, a necessary condition for linearity, is defined for discrete-time systems. N-state machines with this property have finite memory ?=N-1. Linear and autonomous systems are important classes of systems with decomposition. Several representations of systems with decomposition are given and a general form of the discrete-time state equations for a finite-memory system with decomposition is derived. An algorithm is developed by which an arbitrary complete-sequential machine may be tested for decomposition.
Index Terms:
Decomposition property, discrete-time systems, finite-memory systems, linear, sequential machines.
Citation:
K.L. Doty, H. Frank, "Discrete-Time Systems with the Decomposition Property," IEEE Transactions on Computers, vol. 19, no. 5, pp. 412-420, May 1970, doi:10.1109/T-C.1970.222939
Usage of this product signifies your acceptance of the Terms of Use.

