We study the complexity of B-free subshifts which are proximal and of zero entropy. Such subshifts are generated by Behrend sets. The complexity is shown to achieve any subexponential growth and is estimated for some classical subshifts (prime and semiprime subshifts). We also show that B-admissible subshifts are transitive only for coprime sets B which allows one to characterize dynamically the subshifts generated by the Erdös sets.* Research supported by Narodowe Centrum Nauki grant UMO-2019/33/B/ST1/00364 1 Given y ∈ {0, 1} , by (X y , S ) we denote the subshift generated by y, i.e. X y := {S j y : j ∈ }, where S stands for the left shift, S ((z n ) n∈ ) = (z n+1 ) n∈ . We also consider y which are only one-sided, i.e. y ∈ {0, 1} AE∪{0} . Then X y means the subshift obtained from the symmetrized y: y(0) = 0 and y(−n) = y(n).