摘要
讨论了一类模糊双向联想记忆网络极限环的最大长度.首先,A是强连通布尔矩阵时,极限环的最大长度是A的周期指数per(A);其次,A具有形式(☆)时,若gcd(per(A1),per(A2))=1,则极限环的最大长度为max(per(A1),per(A2));若gcd(per(A1),per(A2))≥2,则其最大长度为lcm(per(A1),per(A2));最后对其进行推广.
The paper discussed the maximum length of limit cycle for a special fuzzy bidirectional associative memories and gave some results. Firstly, the maximum length of limit cycle is period index of A, i. e. per (A), if A is strongly connected Boolean matrix. Secondly, for A with the form (☆), the maximum length of limit cycle is max(per(A1),per(A2)), if gcd(per(A1),per(A2)) = 1; 1cm(per(A1),per(A2)), if gcd(per(A1),per(A2))≥ 2. Finally, the results were generalized.
出处
《数学的实践与认识》
CSCD
北大核心
2007年第10期173-177,共5页
Mathematics in Practice and Theory