This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Aspects of the Upper Bounds of Finite Input-Memory and Finite Output-Memory Sequential Machines
March 1979 (vol. 28 no. 3)
pp. 249-253
M. Freeman, Bell Laboratories
In this paper upper bounds on the finite input-memory ?iand finite output-memory ?oof 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
Usage of this product signifies your acceptance of the Terms of Use.