Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines

Any sequential machine M represents a function fM from input sequences to output symbols. A function f is representable if some finite-state sequential machine represents it. The function fM is cal...