搜索结果: 1-1 共查到“代数学 almost periodic sequences”相关记录1条 . 查询时间(0.083 秒)
Forbidden substrings, Kolmogorov complexity and almost periodic sequences
Forbidden substrings Kolmogorov complexity almost periodic sequences
2010/12/10
Assume that for some < 1 and for all nutural n a set Fn of at most 2 n “forbidden” binary strings of length n is fixed. Then there exists an infinite binary sequence ! that does not have (long) forb...