ON LOWER BOUND TO MEMORY OF FINITE STATE MACHINES

被引：3
作者：
VAIRAVAN, K
机构：
[1] Department of Electrical Engineering, University of Wisconsin, Milwaukee
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1969年 / C 18卷 / 09期
关键词：
D O I：
10.1109/T-C.1969.222782
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A finite state machine (FSM) is said to have finite memory µ if µ is the least integer such that yk=f(xk, xk-1,…,xk-μ, yk-1, … μk-u) where yk and xkrepresent the output and input at time k. If no such µ exists, then by convention the memory is said to be infinite. It has been observed [1] that if the memory of a p-nary input, q-nary output n-state minimal nondegenerate FSM is finite, then the memory µ is bounded as follows. © 1969 IEEE. All rights reserved.
引用
收藏
页码：856 / &
相关论文
共 50 条
12345