The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1979 vol.28)
pp: 249-253
M. Freeman , Bell Laboratories
ABSTRACT
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
INDEX TERMS
upper bound, Completely specified machine, finite input-memory, finite output-memory, incompletely specified machine, sequential machine
CITATION
M. Freeman, "Aspects of the Upper Bounds of Finite Input-Memory and Finite Output-Memory Sequential Machines", IEEE Transactions on Computers, vol.28, no. 3, pp. 249-253, March 1979, doi:10.1109/TC.1979.1675327
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool