This Article 
 Bibliographic References 
 Add to: 
Minimal Input-Memory and Output-Memory Finite-State Machines
June 1972 (vol. 21 no. 6)
pp. 598-602
K. Vairavan, Department of Electrical Engineering, University of Wisconsin-Milwaukee, Milwaukee, Wis. 53201.
A finite-state machine (FSM) is said to have finite input-memory, ¿i (finite output-memory ¿o) if ¿i(¿o) is the least integer such that yk = f(Xk, Xk-1,..., Xk-¿i), (yk = f(Xk, yk-1,..., yk-¿o)). If no such integer ¿i(¿o) exists then by convention ¿i = ¿ (¿ = ¿). It is well known that for a nondegenerate binary-input binary-output FSM M, ¿i ¿ [log2 n] (¿o ¿ [log2 n]), where n is the number of non-equivalent states in M. In this note we show that the above bound cannot be improved upon by giving a procedure to construct, for any n ≫ 0, a binary-input binary-output FSM with n nonequivalent states and minimal input-memory ¿i = [log2 n] (minimal output-memory ¿o = [ log2 n]). In the process of proving the tightness of the lower bound on ¿i(¿o), we enumerate the number of distinct minimal binary r-stage feed-forward (output feedback) shift registers.
K. Vairavan, "Minimal Input-Memory and Output-Memory Finite-State Machines," IEEE Transactions on Computers, vol. 21, no. 6, pp. 598-602, June 1972, doi:10.1109/TC.1972.5009017
Usage of this product signifies your acceptance of the Terms of Use.