期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Limit Theorems for Chaitin Complexity
1
作者 杨恩辉 《Chinese Science Bulletin》 SCIE EI CAS 1993年第5期361-365,共5页
1 Statement of Limit Theorems Let A={a<sub>1</sub>,…, a<sub>|A|</sub>} be a finite alphabet, B={0, 1}, and N={0, 1,…}. By A<sup>n</sup>(A<sup>∞</sup>, resp.), we de... 1 Statement of Limit Theorems Let A={a<sub>1</sub>,…, a<sub>|A|</sub>} be a finite alphabet, B={0, 1}, and N={0, 1,…}. By A<sup>n</sup>(A<sup>∞</sup>, resp.), we denote the set of words with the length n(∞, resp.) from the alphabet A; let A<sup>*</sup>= A<sup>n</sup>. B<sup>n</sup>, B<sup>∞</sup> and B<sup>*</sup> are defined similarly. A<sup>n</sup>(A<sup>∞</sup>, resp.) is also considered to be the n-fold (infinite, resp.) Cartesian product of A. If x=(x<sub>i</sub>) is a finite or infinite 展开更多
关键词 Chaitin complesity Shamon ENTROPY RATE of SOURCES UNIVERSAL noiseless coding.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部