Table 4.

Block decomposition method (BDM) algorithmic complexity estimation, BDM logical depth estimation, Shannon entropy, second-order entropy, LZ complexity. The measures are estimated using The Online Algorithmic Complexity Calculator (https://complexitycalculator.com/index.html) block size 12, alphabet size 256. Spike trains are extracted with (a) θ = a and (b) θ = 2 · a, where a is an average interval between two consequent spikes, see table 1. We also provide values of the LZ complexity and algorithmic complexity normalized by input string lengths. In table (c), we provide data on the strings of train powers (in number of spikes) calculated with θ = a and then filtered so values over 9 are removed and the complexity is estimated in alphabet of nine symbols.

	C. militaris	F. velutipes	S. commune	O. nidiformis
(a)
algorithmic complexity, bits	1211	1052	981	1243
algorithmic complexity normalized	6.51	3.94	7.55	3.67
logical depth, steps	4321	4957	3702	5425
logical depth normalized	23	19	28	16
Shannon entropy, bits	2.4	2.3	2.3	2.3
second-order entropy, bits	3.8	3.7	3.7	3.7
LZ complexity, bits	1153	1495	910	1763
LZ complexity (normalized), bits	6.2	5.6	7	5.2
input string length	186	267	130	339

	C. militaris	F. velutipes	S. commune	O. nidiformis
(b)
algorithmic complexity, bits	1047	1295	980	1393
algorithmic complexity normalized	10.57	10.04	14.4	8.82
logical depth, steps	2860	4147	3046	4731
logical depth normalized	29	32	45	30
Shannon entropy, bits	2.5	2.5	2.5	2.6
second-order entropy, bits	4	4.2	4.2	4.3
LZ complexity, bits	594	993	666	1232
LZ complexity normalized	6	7.7	9.8	7.8
input string length	99	129	68	158

	C. militaris	F. velutipes	S. commune	O. nidiformis
(c)
algorithmic complexity, bits	679	976	466	1276
algorithmic complexity normalized	3.96	3.97	4.05	4
Shannon entropy, bits	2.5	2.6	2.5	2.5
second-order entropy, bits	4.7	5	4.5	4.9
LZ complexity, bits	735	1009	563	1208
LZ complexity normalized	4.3	4.1	4.9	3.8
input string length	171	246	115	319