The Community for Technology Leaders
Green Image
In this paper upper bounds on the finite input-memory ?<inf>i</inf>and finite output-memory ?<inf>o</inf>of n-state completely specified sequential machines (CSSM's) and incompletely specified sequential machines (ISSM's) are investigated. It is observed through computational means that N = n(n - 1)/2 is not a tight upper bound for finite input-memory of ISSM's and finite output-memory of both CSS
upper bound, Completely specified machine, finite input-memory, finite output-memory, incompletely specified machine, sequential machine

M. Freeman, "Aspects of the Upper Bounds of Finite Input-Memory and Finite Output-Memory Sequential Machines," in IEEE Transactions on Computers, vol. 28, no. , pp. 249-253, 1979.
86 ms
(Ver 3.3 (11022016))