All the 2n strings for n = 7 from D(5) sorted from highest frequency (hence lowest complexity) to lowest frequency (hence highest (random) complexity).
收藏Figshare2015-12-02 更新2026-04-29 收录
下载链接：
https://figshare.com/articles/dataset/_All_the_2_n_strings_for_n_7_from_D_5_sorted_from_highest_frequency_hence_lowest_complexity_to_lowest_frequency_hence_highest_random_complexity_/1021249
下载链接
链接失效反馈官方服务：
资源简介：
Strings in each row have the same frequency (hence the same Kolmogorov complexity). There are 31 different groups representing the different complexities of the 27 = 128 strings.
创建时间：
2015-12-02
