Abstract
Sequential machines with time-variant logic and memory elements are investigated in this paper. Our major efforts are exerted toward considering the isomorphism, minimality, periodicity, time invariance, and convertibility of time-varying sequential machines with an arbitrary set of internal states. It turns out that, if an infinite-state time-varying sequential machine is finite-state realizable, it must eventually bear some sort of a periodic structure and satisfy a time-invariance property on an extended time basis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Deuel, “Time-varying linear sequential machines I,”J. Comput. Syst. Sci. 3(1):93–118 (1969).
A. Gill, “Time-varying sequential machines,”J. Franklin Inst. 276(6):519–539 (1963).
A. Gill and R. Flexer, “Periodic decomposition of sequential machines,”J. Assoc. Comput. Mach. 14(4):666–676 (1967).
K. Hwang, “Periodic realization of synchronous sequential machines,”IEEE Trans, on Computers C-22(10):923–927 (1973).
K. Hwang, “Cyclic decomposition of finite stochastic systems,”J. Comput. Syst. Sci. 9(1):56–68 (1974).
E. S. Santos and W. G. Wee, “General formulations of sequential machines,”Information and Control 12(1):5–10 (1968).
L. A. Zadeh and E. Polak, Eds.,System Theory (McGraw-Hill, New York, 1969).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hwang, K. Some structural complexities of time-varying sequential machines. International Journal of Computer and Information Sciences 4, 237–245 (1975). https://doi.org/10.1007/BF01007761
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01007761