%0 Generic %A Soler-Toscano, Fernando %A Zenil, Hector %A Delahaye, Jean-Paul %A Gauvrit, Nicolas %D 2014 %T All the 2n strings for n = 7 from D(5) sorted from highest frequency (hence lowest complexity) to lowest frequency (hence highest (random) complexity). %U https://plos.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 %R 10.1371/journal.pone.0096223.t003 %2 https://plos.figshare.com/ndownloader/files/1490978 %K Computerized simulations %K Computing methods %K Computing systems %K Digital computing %K information theory %K Systems science %K Complex systems %K mathematics %K Applied mathematics %K algorithms %K physics %K Statistical mechanics %K strings %K sorted %K highest %K lowest %X

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.

%I PLOS ONE